./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20f8b62eff4e734254f2d93fb2faeb4ade7cfcb3503703e0a4da4a961e3bc50b
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:40:35,765 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:40:35,767 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:40:35,788 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:40:35,789 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:40:35,789 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:40:35,790 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:40:35,791 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:40:35,793 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:40:35,793 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:40:35,794 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:40:35,795 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:40:35,795 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:40:35,796 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:40:35,797 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:40:35,797 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:40:35,798 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:40:35,799 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:40:35,800 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:40:35,801 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:40:35,802 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:40:35,804 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:40:35,806 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:40:35,807 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:40:35,812 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:40:35,812 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:40:35,812 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:40:35,813 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:40:35,813 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:40:35,814 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:40:35,814 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:40:35,814 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:40:35,815 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:40:35,815 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:40:35,816 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:40:35,816 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:40:35,817 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:40:35,817 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:40:35,817 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:40:35,818 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:40:35,818 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:40:35,819 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:40:35,835 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:40:35,835 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:40:35,835 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:40:35,835 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:40:35,840 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:40:35,840 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:40:35,840 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:40:35,840 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:40:35,840 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:40:35,841 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:40:35,841 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:40:35,842 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:40:35,842 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:40:35,843 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:40:35,843 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:40:35,844 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:40:35,844 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20f8b62eff4e734254f2d93fb2faeb4ade7cfcb3503703e0a4da4a961e3bc50b
[2024-03-11 22:40:36,020 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:40:36,048 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:40:36,050 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:40:36,051 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:40:36,051 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:40:36,052 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-11 22:40:37,169 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:40:37,341 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:40:37,341 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-03-11 22:40:37,352 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e9c3a5852/e642b5e68a2b462f8209c9956c72ec46/FLAGce1e14a41
[2024-03-11 22:40:37,368 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/e9c3a5852/e642b5e68a2b462f8209c9956c72ec46
[2024-03-11 22:40:37,370 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:40:37,370 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:40:37,371 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:40:37,372 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:40:37,374 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:40:37,375 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,375 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7d47e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37, skipping insertion in model container
[2024-03-11 22:40:37,376 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,381 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:40:37,415 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:40:37,525 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:40:37,657 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:40:37,663 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:40:37,673 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:40:37,698 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:40:37,743 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:40:37,743 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37 WrapperNode
[2024-03-11 22:40:37,743 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:40:37,744 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:40:37,744 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:40:37,744 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:40:37,749 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,763 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,779 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2024-03-11 22:40:37,780 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:40:37,780 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:40:37,780 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:40:37,781 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:40:37,787 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,787 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,791 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,791 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,798 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,801 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,802 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,803 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,805 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:40:37,805 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:40:37,806 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:40:37,806 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:40:37,806 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (1/1) ...
[2024-03-11 22:40:37,810 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:40:37,818 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:40:37,828 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:40:37,831 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:40:37,852 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:40:37,852 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:40:37,852 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:40:37,852 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:40:37,853 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:40:37,853 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-03-11 22:40:37,853 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:40:37,853 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:40:37,853 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:40:37,853 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:40:37,854 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:40:37,963 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:40:37,965 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:40:38,130 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:40:38,136 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:40:38,136 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:40:38,137 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:40:38 BoogieIcfgContainer
[2024-03-11 22:40:38,137 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:40:38,139 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:40:38,139 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:40:38,142 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:40:38,142 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:40:37" (1/3) ...
[2024-03-11 22:40:38,142 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2995068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:40:38, skipping insertion in model container
[2024-03-11 22:40:38,142 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:40:37" (2/3) ...
[2024-03-11 22:40:38,142 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2995068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:40:38, skipping insertion in model container
[2024-03-11 22:40:38,143 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:40:38" (3/3) ...
[2024-03-11 22:40:38,144 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-03-11 22:40:38,149 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:40:38,156 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:40:38,156 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-11 22:40:38,156 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:40:38,193 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:40:38,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,259 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-03-11 22:40:38,259 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:40:38,263 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-11 22:40:38,263 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,267 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,269 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:40:38,277 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,279 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2024-03-11 22:40:38,302 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2024-03-11 22:40:38,303 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:40:38,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 195 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-03-11 22:40:38,304 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2024-03-11 22:40:40,068 INFO  L134        LiptonReduction]: Checked pairs total: 5330
[2024-03-11 22:40:40,069 INFO  L136        LiptonReduction]: Total number of compositions: 73
[2024-03-11 22:40:40,082 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:40:40,087 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45393036, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:40:40,087 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:40:40,090 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-03-11 22:40:40,091 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:40:40,091 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:40,091 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:40,092 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:40:40,095 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:40,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 487835987, now seen corresponding path program 1 times
[2024-03-11 22:40:40,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:40,102 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493864060]
[2024-03-11 22:40:40,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:40,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:40,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:40,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:40,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:40,486 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493864060]
[2024-03-11 22:40:40,487 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493864060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:40,487 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:40,487 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:40,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368784663]
[2024-03-11 22:40:40,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:40,494 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:40,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:40,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:40,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:40,745 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 174
[2024-03-11 22:40:40,749 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:40,749 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:40,749 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 174
[2024-03-11 22:40:40,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:40,970 INFO  L130       PetriNetUnfolder]: 135/357 cut-off events.
[2024-03-11 22:40:40,970 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:40:40,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 684 conditions, 357 events. 135/357 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1537 event pairs, 91 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 627. Up to 281 conditions per place. 
[2024-03-11 22:40:40,974 INFO  L137   encePairwiseOnDemand]: 163/174 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2024-03-11 22:40:40,974 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2024-03-11 22:40:40,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:40,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:40,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2024-03-11 22:40:40,989 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4482758620689655
[2024-03-11 22:40:40,990 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2024-03-11 22:40:40,990 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2024-03-11 22:40:40,991 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:40,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2024-03-11 22:40:40,997 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,001 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,002 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,003 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2024-03-11 22:40:41,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2024-03-11 22:40:41,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:41,009 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2024-03-11 22:40:41,010 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2024-03-11 22:40:41,013 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2024-03-11 22:40:41,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2024-03-11 22:40:41,014 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,014 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:41,014 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:41,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:40:41,014 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:40:41,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:41,015 INFO  L85        PathProgramCache]: Analyzing trace with hash -679564975, now seen corresponding path program 1 times
[2024-03-11 22:40:41,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:41,015 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311672436]
[2024-03-11 22:40:41,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:41,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:41,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:41,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:41,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:41,056 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311672436]
[2024-03-11 22:40:41,056 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311672436] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:41,056 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:41,056 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:40:41,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091215602]
[2024-03-11 22:40:41,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:41,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:40:41,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:41,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:40:41,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:40:41,117 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 174
[2024-03-11 22:40:41,118 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,118 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:41,118 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 174
[2024-03-11 22:40:41,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:41,185 INFO  L130       PetriNetUnfolder]: 47/206 cut-off events.
[2024-03-11 22:40:41,185 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2024-03-11 22:40:41,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 426 conditions, 206 events. 47/206 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 825 event pairs, 4 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 361. Up to 53 conditions per place. 
[2024-03-11 22:40:41,187 INFO  L137   encePairwiseOnDemand]: 170/174 looper letters, 17 selfloop transitions, 2 changer transitions 2/64 dead transitions.
[2024-03-11 22:40:41,187 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 265 flow
[2024-03-11 22:40:41,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:40:41,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:40:41,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions.
[2024-03-11 22:40:41,193 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-03-11 22:40:41,193 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 377 transitions.
[2024-03-11 22:40:41,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 377 transitions.
[2024-03-11 22:40:41,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:41,194 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 377 transitions.
[2024-03-11 22:40:41,195 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,199 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,200 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,200 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 377 transitions.
[2024-03-11 22:40:41,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 265 flow
[2024-03-11 22:40:41,204 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:41,206 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2024-03-11 22:40:41,206 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2024-03-11 22:40:41,207 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2024-03-11 22:40:41,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2024-03-11 22:40:41,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,208 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:41,208 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:41,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:40:41,209 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:40:41,209 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:41,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -466678458, now seen corresponding path program 1 times
[2024-03-11 22:40:41,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:41,210 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103217032]
[2024-03-11 22:40:41,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:41,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:41,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:41,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:41,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:41,406 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103217032]
[2024-03-11 22:40:41,406 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103217032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:41,406 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:41,406 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:41,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476361398]
[2024-03-11 22:40:41,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:41,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:41,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:41,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:41,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:41,552 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 174
[2024-03-11 22:40:41,552 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,553 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:41,553 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 174
[2024-03-11 22:40:41,553 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:41,900 INFO  L130       PetriNetUnfolder]: 193/496 cut-off events.
[2024-03-11 22:40:41,901 INFO  L131       PetriNetUnfolder]: For 122/126 co-relation queries the response was YES.
[2024-03-11 22:40:41,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 496 events. 193/496 cut-off events. For 122/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2276 event pairs, 39 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2024-03-11 22:40:41,907 INFO  L137   encePairwiseOnDemand]: 156/174 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2024-03-11 22:40:41,907 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2024-03-11 22:40:41,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:41,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:41,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2024-03-11 22:40:41,910 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.514367816091954
[2024-03-11 22:40:41,910 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2024-03-11 22:40:41,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2024-03-11 22:40:41,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:41,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2024-03-11 22:40:41,911 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,913 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,913 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2024-03-11 22:40:41,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2024-03-11 22:40:41,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-11 22:40:41,917 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2024-03-11 22:40:41,918 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2024-03-11 22:40:41,918 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2024-03-11 22:40:41,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2024-03-11 22:40:41,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:41,919 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:41,919 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:41,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:40:41,919 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:40:41,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:41,919 INFO  L85        PathProgramCache]: Analyzing trace with hash -1359997872, now seen corresponding path program 1 times
[2024-03-11 22:40:41,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:41,920 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910469131]
[2024-03-11 22:40:41,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:41,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:41,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:42,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:40:42,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:42,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910469131]
[2024-03-11 22:40:42,118 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910469131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:42,118 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:42,118 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:42,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510502465]
[2024-03-11 22:40:42,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:42,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:42,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:42,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:42,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:42,267 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 174
[2024-03-11 22:40:42,268 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:42,268 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:42,268 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 174
[2024-03-11 22:40:42,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:42,427 INFO  L130       PetriNetUnfolder]: 200/559 cut-off events.
[2024-03-11 22:40:42,427 INFO  L131       PetriNetUnfolder]: For 328/340 co-relation queries the response was YES.
[2024-03-11 22:40:42,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 559 events. 200/559 cut-off events. For 328/340 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2813 event pairs, 43 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2024-03-11 22:40:42,431 INFO  L137   encePairwiseOnDemand]: 163/174 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2024-03-11 22:40:42,431 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2024-03-11 22:40:42,437 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:42,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:42,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2024-03-11 22:40:42,439 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46839080459770116
[2024-03-11 22:40:42,439 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2024-03-11 22:40:42,439 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2024-03-11 22:40:42,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:42,440 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2024-03-11 22:40:42,442 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:42,444 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:42,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:42,445 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2024-03-11 22:40:42,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2024-03-11 22:40:42,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:42,453 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2024-03-11 22:40:42,453 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2024-03-11 22:40:42,454 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2024-03-11 22:40:42,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2024-03-11 22:40:42,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:42,455 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:42,455 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:40:42,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:40:42,455 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:40:42,455 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:42,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040487698, now seen corresponding path program 1 times
[2024-03-11 22:40:42,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:42,456 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272475380]
[2024-03-11 22:40:42,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:42,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:42,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:40:42,476 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:40:42,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:40:42,502 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:40:42,502 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:40:42,503 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:40:42,504 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:40:42,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:40:42,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:40:42,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:40:42,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:40:42,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:40:42,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:40:42,505 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-11 22:40:42,507 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:40:42,507 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:40:42,528 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:40:42,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,551 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-03-11 22:40:42,551 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:40:42,551 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 465 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-03-11 22:40:42,552 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,552 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,553 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:40:42,553 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,553 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,553 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2024-03-11 22:40:42,569 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2024-03-11 22:40:42,569 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:40:42,569 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 465 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2024-03-11 22:40:42,572 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2024-03-11 22:40:44,012 INFO  L134        LiptonReduction]: Checked pairs total: 15360
[2024-03-11 22:40:44,012 INFO  L136        LiptonReduction]: Total number of compositions: 71
[2024-03-11 22:40:44,013 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:40:44,014 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45393036, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:40:44,014 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:40:44,016 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2024-03-11 22:40:44,016 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:40:44,016 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:44,016 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:44,016 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:44,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:44,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 1302414291, now seen corresponding path program 1 times
[2024-03-11 22:40:44,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:44,017 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778227879]
[2024-03-11 22:40:44,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:44,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:44,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:44,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:44,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:44,142 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778227879]
[2024-03-11 22:40:44,143 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778227879] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:44,143 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:44,143 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:44,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329796956]
[2024-03-11 22:40:44,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:44,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:44,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:44,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:44,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:44,283 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189
[2024-03-11 22:40:44,284 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,284 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:44,284 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189
[2024-03-11 22:40:44,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:44,843 INFO  L130       PetriNetUnfolder]: 2299/4148 cut-off events.
[2024-03-11 22:40:44,844 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2024-03-11 22:40:44,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8060 conditions, 4148 events. 2299/4148 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23079 event pairs, 1715 based on Foata normal form. 0/3932 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2024-03-11 22:40:44,858 INFO  L137   encePairwiseOnDemand]: 175/189 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2024-03-11 22:40:44,858 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2024-03-11 22:40:44,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:44,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:44,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2024-03-11 22:40:44,861 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-03-11 22:40:44,861 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2024-03-11 22:40:44,861 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2024-03-11 22:40:44,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:44,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2024-03-11 22:40:44,862 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,864 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,864 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,864 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2024-03-11 22:40:44,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2024-03-11 22:40:44,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:44,866 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2024-03-11 22:40:44,867 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2024-03-11 22:40:44,867 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2024-03-11 22:40:44,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2024-03-11 22:40:44,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,868 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:44,868 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:44,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:40:44,868 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:44,868 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:44,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -625452762, now seen corresponding path program 1 times
[2024-03-11 22:40:44,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:44,868 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588991461]
[2024-03-11 22:40:44,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:44,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:44,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:44,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:44,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:44,902 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588991461]
[2024-03-11 22:40:44,903 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588991461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:44,903 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:44,903 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:40:44,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249008993]
[2024-03-11 22:40:44,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:44,904 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:40:44,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:44,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:40:44,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:40:44,961 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 189
[2024-03-11 22:40:44,962 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:44,962 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:44,962 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 189
[2024-03-11 22:40:44,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:45,178 INFO  L130       PetriNetUnfolder]: 837/2035 cut-off events.
[2024-03-11 22:40:45,178 INFO  L131       PetriNetUnfolder]: For 291/380 co-relation queries the response was YES.
[2024-03-11 22:40:45,182 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 2035 events. 837/2035 cut-off events. For 291/380 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13116 event pairs, 364 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 2172. Up to 893 conditions per place. 
[2024-03-11 22:40:45,188 INFO  L137   encePairwiseOnDemand]: 185/189 looper letters, 34 selfloop transitions, 2 changer transitions 2/99 dead transitions.
[2024-03-11 22:40:45,188 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 437 flow
[2024-03-11 22:40:45,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:40:45,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:40:45,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions.
[2024-03-11 22:40:45,190 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5952380952380952
[2024-03-11 22:40:45,190 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 450 transitions.
[2024-03-11 22:40:45,190 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions.
[2024-03-11 22:40:45,190 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:45,190 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions.
[2024-03-11 22:40:45,191 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:45,192 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:45,192 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:45,193 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 450 transitions.
[2024-03-11 22:40:45,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 437 flow
[2024-03-11 22:40:45,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:45,196 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2024-03-11 22:40:45,196 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2024-03-11 22:40:45,197 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2024-03-11 22:40:45,197 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2024-03-11 22:40:45,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:45,197 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:45,197 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:45,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:40:45,198 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:45,198 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:45,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 111764048, now seen corresponding path program 1 times
[2024-03-11 22:40:45,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:45,198 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687540903]
[2024-03-11 22:40:45,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:45,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:45,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:45,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:45,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:45,342 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687540903]
[2024-03-11 22:40:45,343 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687540903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:45,343 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:45,343 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:45,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936752260]
[2024-03-11 22:40:45,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:45,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:45,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:45,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:45,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:45,472 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189
[2024-03-11 22:40:45,473 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:45,474 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:45,474 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189
[2024-03-11 22:40:45,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:46,378 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2024-03-11 22:40:46,378 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2024-03-11 22:40:46,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38314 event pairs, 1337 based on Foata normal form. 0/6112 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2024-03-11 22:40:46,406 INFO  L137   encePairwiseOnDemand]: 163/189 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2024-03-11 22:40:46,406 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2024-03-11 22:40:46,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:46,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:46,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2024-03-11 22:40:46,409 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5925925925925926
[2024-03-11 22:40:46,409 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2024-03-11 22:40:46,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2024-03-11 22:40:46,409 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:46,409 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2024-03-11 22:40:46,411 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:46,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:46,412 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:46,412 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2024-03-11 22:40:46,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2024-03-11 22:40:46,416 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-11 22:40:46,418 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2024-03-11 22:40:46,418 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2024-03-11 22:40:46,419 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-03-11 22:40:46,419 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2024-03-11 22:40:46,419 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:46,419 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:46,420 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:46,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 22:40:46,420 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:46,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:46,420 INFO  L85        PathProgramCache]: Analyzing trace with hash 429862598, now seen corresponding path program 1 times
[2024-03-11 22:40:46,420 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:46,420 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635290452]
[2024-03-11 22:40:46,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:46,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:46,430 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:46,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:40:46,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:46,590 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635290452]
[2024-03-11 22:40:46,590 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635290452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:40:46,590 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:40:46,590 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:40:46,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271036421]
[2024-03-11 22:40:46,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:40:46,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:40:46,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:46,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:40:46,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:40:46,728 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189
[2024-03-11 22:40:46,729 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:46,729 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:46,729 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189
[2024-03-11 22:40:46,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:47,661 INFO  L130       PetriNetUnfolder]: 4200/7813 cut-off events.
[2024-03-11 22:40:47,661 INFO  L131       PetriNetUnfolder]: For 6314/6605 co-relation queries the response was YES.
[2024-03-11 22:40:47,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25533 conditions, 7813 events. 4200/7813 cut-off events. For 6314/6605 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 51358 event pairs, 1254 based on Foata normal form. 11/7506 useless extension candidates. Maximal degree in co-relation 20119. Up to 5834 conditions per place. 
[2024-03-11 22:40:47,699 INFO  L137   encePairwiseOnDemand]: 169/189 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2024-03-11 22:40:47,699 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2024-03-11 22:40:47,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:40:47,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:40:47,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2024-03-11 22:40:47,702 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5326278659611993
[2024-03-11 22:40:47,702 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2024-03-11 22:40:47,702 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2024-03-11 22:40:47,702 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:47,702 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2024-03-11 22:40:47,703 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:47,705 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:47,705 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:47,705 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2024-03-11 22:40:47,705 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2024-03-11 22:40:47,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:47,768 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2024-03-11 22:40:47,768 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2024-03-11 22:40:47,769 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2024-03-11 22:40:47,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2024-03-11 22:40:47,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:47,769 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:47,769 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:47,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:40:47,770 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:47,770 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:47,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 139843627, now seen corresponding path program 1 times
[2024-03-11 22:40:47,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:47,771 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193923257]
[2024-03-11 22:40:47,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:47,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:47,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:48,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:48,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:48,048 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193923257]
[2024-03-11 22:40:48,048 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193923257] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:40:48,049 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133785205]
[2024-03-11 22:40:48,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:48,049 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:40:48,049 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:40:48,051 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:40:48,069 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 22:40:48,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:48,194 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-11 22:40:48,200 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:40:48,234 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:40:48,248 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:40:48,248 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:40:48,272 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:40:48,283 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:40:48,303 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:48,304 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:40:48,324 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:48,325 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:40:48,364 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:40:48,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:48,374 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:40:48,409 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))) is different from false
[2024-03-11 22:40:48,433 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_349 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2024-03-11 22:40:48,456 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_349 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_349) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))) is different from false
[2024-03-11 22:40:48,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:40:48,554 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133785205] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:40:48,554 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:40:48,555 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2024-03-11 22:40:48,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810286459]
[2024-03-11 22:40:48,555 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:40:48,555 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-11 22:40:48,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:48,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-11 22:40:48,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=101, Unknown=3, NotChecked=66, Total=210
[2024-03-11 22:40:48,598 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189
[2024-03-11 22:40:48,599 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 15 states, 15 states have (on average 54.6) internal successors, (819), 15 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:48,600 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:48,600 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189
[2024-03-11 22:40:48,600 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:50,923 INFO  L130       PetriNetUnfolder]: 6855/11555 cut-off events.
[2024-03-11 22:40:50,923 INFO  L131       PetriNetUnfolder]: For 19240/19244 co-relation queries the response was YES.
[2024-03-11 22:40:50,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43774 conditions, 11555 events. 6855/11555 cut-off events. For 19240/19244 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 70641 event pairs, 2458 based on Foata normal form. 0/10219 useless extension candidates. Maximal degree in co-relation 28221. Up to 9614 conditions per place. 
[2024-03-11 22:40:50,975 INFO  L137   encePairwiseOnDemand]: 164/189 looper letters, 353 selfloop transitions, 104 changer transitions 0/461 dead transitions.
[2024-03-11 22:40:50,975 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 461 transitions, 3797 flow
[2024-03-11 22:40:50,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-11 22:40:50,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-11 22:40:50,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 886 transitions.
[2024-03-11 22:40:50,978 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3606023606023606
[2024-03-11 22:40:50,978 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 886 transitions.
[2024-03-11 22:40:50,978 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 886 transitions.
[2024-03-11 22:40:50,979 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:50,979 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 886 transitions.
[2024-03-11 22:40:50,980 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 68.15384615384616) internal successors, (886), 13 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:50,983 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 189.0) internal successors, (2646), 14 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:50,983 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 189.0) internal successors, (2646), 14 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:50,983 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 13 states and 886 transitions.
[2024-03-11 22:40:50,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 461 transitions, 3797 flow
[2024-03-11 22:40:51,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 461 transitions, 3561 flow, removed 118 selfloop flow, removed 0 redundant places.
[2024-03-11 22:40:51,043 INFO  L231             Difference]: Finished difference. Result has 107 places, 301 transitions, 2243 flow
[2024-03-11 22:40:51,044 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2243, PETRI_PLACES=107, PETRI_TRANSITIONS=301}
[2024-03-11 22:40:51,044 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 50 predicate places.
[2024-03-11 22:40:51,044 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 301 transitions, 2243 flow
[2024-03-11 22:40:51,045 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 54.6) internal successors, (819), 15 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:51,045 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:51,045 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:51,054 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 22:40:51,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-11 22:40:51,246 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:51,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:51,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640930147, now seen corresponding path program 1 times
[2024-03-11 22:40:51,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:51,247 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354785790]
[2024-03-11 22:40:51,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:51,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:51,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:51,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:51,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:51,532 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354785790]
[2024-03-11 22:40:51,533 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354785790] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:40:51,533 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003814787]
[2024-03-11 22:40:51,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:51,533 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:40:51,533 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:40:51,534 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:40:51,535 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-11 22:40:51,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:51,644 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-11 22:40:51,647 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:40:51,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:40:51,675 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:40:51,675 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:40:51,695 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-03-11 22:40:51,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-03-11 22:40:51,724 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:51,725 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-03-11 22:40:51,740 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:51,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-03-11 22:40:51,757 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2024-03-11 22:40:51,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:51,768 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:40:51,787 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2024-03-11 22:40:51,900 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-11 22:40:51,928 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-11 22:40:51,980 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:51,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2024-03-11 22:40:51,988 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:51,988 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28
[2024-03-11 22:40:52,000 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-11 22:40:52,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-11 22:40:52,014 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-11 22:40:52,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-11 22:40:52,023 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-03-11 22:40:52,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-03-11 22:40:52,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:40:52,043 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003814787] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:40:52,043 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:40:52,044 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2024-03-11 22:40:52,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623611703]
[2024-03-11 22:40:52,044 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:40:52,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-03-11 22:40:52,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:52,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-03-11 22:40:52,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=116, Unknown=6, NotChecked=72, Total=240
[2024-03-11 22:40:52,118 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 189
[2024-03-11 22:40:52,119 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 301 transitions, 2243 flow. Second operand  has 16 states, 16 states have (on average 59.625) internal successors, (954), 16 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:52,119 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:52,119 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 189
[2024-03-11 22:40:52,119 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:40:55,769 INFO  L130       PetriNetUnfolder]: 8543/14352 cut-off events.
[2024-03-11 22:40:55,769 INFO  L131       PetriNetUnfolder]: For 32036/32036 co-relation queries the response was YES.
[2024-03-11 22:40:55,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63967 conditions, 14352 events. 8543/14352 cut-off events. For 32036/32036 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 92788 event pairs, 497 based on Foata normal form. 0/13069 useless extension candidates. Maximal degree in co-relation 57341. Up to 7721 conditions per place. 
[2024-03-11 22:40:55,850 INFO  L137   encePairwiseOnDemand]: 140/189 looper letters, 643 selfloop transitions, 516 changer transitions 10/1173 dead transitions.
[2024-03-11 22:40:55,851 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 1173 transitions, 10258 flow
[2024-03-11 22:40:55,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:40:55,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:40:55,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1632 transitions.
[2024-03-11 22:40:55,856 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.454469507101086
[2024-03-11 22:40:55,856 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1632 transitions.
[2024-03-11 22:40:55,856 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1632 transitions.
[2024-03-11 22:40:55,857 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:40:55,857 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1632 transitions.
[2024-03-11 22:40:55,860 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.89473684210526) internal successors, (1632), 19 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:55,864 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:55,864 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 189.0) internal successors, (3780), 20 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:55,865 INFO  L175             Difference]: Start difference. First operand has 107 places, 301 transitions, 2243 flow. Second operand 19 states and 1632 transitions.
[2024-03-11 22:40:55,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 1173 transitions, 10258 flow
[2024-03-11 22:40:56,012 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 1173 transitions, 10234 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-03-11 22:40:56,022 INFO  L231             Difference]: Finished difference. Result has 134 places, 781 transitions, 7915 flow
[2024-03-11 22:40:56,022 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7915, PETRI_PLACES=134, PETRI_TRANSITIONS=781}
[2024-03-11 22:40:56,022 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 77 predicate places.
[2024-03-11 22:40:56,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 781 transitions, 7915 flow
[2024-03-11 22:40:56,023 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.625) internal successors, (954), 16 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:56,023 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:56,023 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:40:56,032 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:40:56,224 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:40:56,224 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:56,226 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:56,226 INFO  L85        PathProgramCache]: Analyzing trace with hash 218945707, now seen corresponding path program 2 times
[2024-03-11 22:40:56,226 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:56,226 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92856995]
[2024-03-11 22:40:56,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:56,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:56,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:56,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:56,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:56,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92856995]
[2024-03-11 22:40:56,517 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92856995] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:40:56,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793716192]
[2024-03-11 22:40:56,517 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:40:56,517 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:40:56,517 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:40:56,518 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:40:56,520 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-11 22:40:56,645 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:40:56,645 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:40:56,646 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-11 22:40:56,649 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:40:56,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:40:56,680 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:40:56,680 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:40:56,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:40:56,835 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:40:56,897 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-03-11 22:40:56,935 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:56,935 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:40:56,979 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:56,979 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:40:57,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:57,015 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:40:57,054 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_558 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_558 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))) is different from false
[2024-03-11 22:40:57,069 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_558 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2024-03-11 22:40:57,083 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_558 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_558) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-03-11 22:40:57,095 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:57,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40
[2024-03-11 22:40:57,101 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:57,102 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 26
[2024-03-11 22:40:57,110 INFO  L321             Elim1Store]: treesize reduction 25, result has 3.8 percent of original size
[2024-03-11 22:40:57,110 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:40:57,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:40:57,138 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [793716192] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:40:57,138 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:40:57,138 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22
[2024-03-11 22:40:57,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521250266]
[2024-03-11 22:40:57,139 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:40:57,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-11 22:40:57,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:57,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-11 22:40:57,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=350, Unknown=3, NotChecked=120, Total=552
[2024-03-11 22:40:57,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189
[2024-03-11 22:40:57,144 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 781 transitions, 7915 flow. Second operand  has 24 states, 24 states have (on average 54.666666666666664) internal successors, (1312), 24 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:57,144 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:57,144 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189
[2024-03-11 22:40:57,144 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:41:00,494 INFO  L130       PetriNetUnfolder]: 8545/14468 cut-off events.
[2024-03-11 22:41:00,495 INFO  L131       PetriNetUnfolder]: For 72551/72557 co-relation queries the response was YES.
[2024-03-11 22:41:00,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88543 conditions, 14468 events. 8545/14468 cut-off events. For 72551/72557 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 92945 event pairs, 1540 based on Foata normal form. 0/13494 useless extension candidates. Maximal degree in co-relation 85029. Up to 9312 conditions per place. 
[2024-03-11 22:41:00,620 INFO  L137   encePairwiseOnDemand]: 171/189 looper letters, 1043 selfloop transitions, 62 changer transitions 17/1126 dead transitions.
[2024-03-11 22:41:00,621 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1126 transitions, 13644 flow
[2024-03-11 22:41:00,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-11 22:41:00,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-11 22:41:00,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 909 transitions.
[2024-03-11 22:41:00,624 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3435374149659864
[2024-03-11 22:41:00,624 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 909 transitions.
[2024-03-11 22:41:00,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 909 transitions.
[2024-03-11 22:41:00,625 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:41:00,625 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 909 transitions.
[2024-03-11 22:41:00,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 64.92857142857143) internal successors, (909), 14 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:00,629 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:00,630 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:00,630 INFO  L175             Difference]: Start difference. First operand has 134 places, 781 transitions, 7915 flow. Second operand 14 states and 909 transitions.
[2024-03-11 22:41:00,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 1126 transitions, 13644 flow
[2024-03-11 22:41:01,204 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 1126 transitions, 13239 flow, removed 193 selfloop flow, removed 4 redundant places.
[2024-03-11 22:41:01,217 INFO  L231             Difference]: Finished difference. Result has 150 places, 836 transitions, 8647 flow
[2024-03-11 22:41:01,218 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=7658, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8647, PETRI_PLACES=150, PETRI_TRANSITIONS=836}
[2024-03-11 22:41:01,218 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 93 predicate places.
[2024-03-11 22:41:01,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 836 transitions, 8647 flow
[2024-03-11 22:41:01,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 54.666666666666664) internal successors, (1312), 24 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:01,219 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:41:01,219 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:41:01,226 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-03-11 22:41:01,420 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-11 22:41:01,421 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:41:01,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:41:01,422 INFO  L85        PathProgramCache]: Analyzing trace with hash 1722407761, now seen corresponding path program 3 times
[2024-03-11 22:41:01,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:41:01,422 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407529525]
[2024-03-11 22:41:01,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:01,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:41:01,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:01,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:01,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:41:01,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407529525]
[2024-03-11 22:41:01,689 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407529525] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:41:01,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468525649]
[2024-03-11 22:41:01,690 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:41:01,690 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:01,690 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:41:01,691 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:41:01,693 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-11 22:41:01,837 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:41:01,837 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:41:01,839 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-11 22:41:01,844 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:41:01,852 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:41:01,881 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:41:01,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:41:02,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:41:02,042 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:41:02,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:41:02,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:41:02,187 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:41:02,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:02,227 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:41:02,244 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2024-03-11 22:41:02,262 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_668 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_668 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2024-03-11 22:41:02,281 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_668 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_668 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_668 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_668 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_668) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))))))) is different from false
[2024-03-11 22:41:02,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:41:02,363 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468525649] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:41:02,363 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:41:02,363 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22
[2024-03-11 22:41:02,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341299830]
[2024-03-11 22:41:02,364 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:41:02,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-11 22:41:02,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:41:02,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-11 22:41:02,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552
[2024-03-11 22:41:02,478 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 189
[2024-03-11 22:41:02,480 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 836 transitions, 8647 flow. Second operand  has 24 states, 24 states have (on average 54.666666666666664) internal successors, (1312), 24 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:02,480 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:41:02,480 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 189
[2024-03-11 22:41:02,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:41:07,742 INFO  L130       PetriNetUnfolder]: 9934/16904 cut-off events.
[2024-03-11 22:41:07,742 INFO  L131       PetriNetUnfolder]: For 91778/91790 co-relation queries the response was YES.
[2024-03-11 22:41:07,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104916 conditions, 16904 events. 9934/16904 cut-off events. For 91778/91790 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 113040 event pairs, 865 based on Foata normal form. 2/15838 useless extension candidates. Maximal degree in co-relation 101298. Up to 11943 conditions per place. 
[2024-03-11 22:41:07,889 INFO  L137   encePairwiseOnDemand]: 163/189 looper letters, 1206 selfloop transitions, 466 changer transitions 4/1680 dead transitions.
[2024-03-11 22:41:07,889 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1680 transitions, 20651 flow
[2024-03-11 22:41:07,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-11 22:41:07,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-11 22:41:07,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1479 transitions.
[2024-03-11 22:41:07,893 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3556998556998557
[2024-03-11 22:41:07,894 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1479 transitions.
[2024-03-11 22:41:07,894 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1479 transitions.
[2024-03-11 22:41:07,894 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:41:07,894 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1479 transitions.
[2024-03-11 22:41:07,897 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 67.22727272727273) internal successors, (1479), 22 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,900 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 189.0) internal successors, (4347), 23 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,901 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 189.0) internal successors, (4347), 23 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,901 INFO  L175             Difference]: Start difference. First operand has 150 places, 836 transitions, 8647 flow. Second operand 22 states and 1479 transitions.
[2024-03-11 22:41:07,901 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1680 transitions, 20651 flow
[2024-03-11 22:41:08,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 1680 transitions, 20591 flow, removed 25 selfloop flow, removed 3 redundant places.
[2024-03-11 22:41:08,879 INFO  L231             Difference]: Finished difference. Result has 179 places, 1200 transitions, 14935 flow
[2024-03-11 22:41:08,879 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=8604, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=14935, PETRI_PLACES=179, PETRI_TRANSITIONS=1200}
[2024-03-11 22:41:08,880 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 122 predicate places.
[2024-03-11 22:41:08,880 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 1200 transitions, 14935 flow
[2024-03-11 22:41:08,880 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 54.666666666666664) internal successors, (1312), 24 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:08,880 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:41:08,881 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:41:08,888 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 22:41:09,081 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:09,082 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:41:09,082 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:41:09,082 INFO  L85        PathProgramCache]: Analyzing trace with hash -751345989, now seen corresponding path program 4 times
[2024-03-11 22:41:09,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:41:09,083 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631009943]
[2024-03-11 22:41:09,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:09,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:41:09,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:09,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:09,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:41:09,345 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631009943]
[2024-03-11 22:41:09,345 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631009943] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:41:09,345 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854928906]
[2024-03-11 22:41:09,345 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:41:09,345 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:09,345 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:41:09,346 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:41:09,348 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-11 22:41:09,537 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:41:09,537 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:41:09,539 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-11 22:41:09,542 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:41:09,546 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:41:09,569 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:41:09,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:41:09,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:41:09,603 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:41:09,618 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-03-11 22:41:09,632 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:09,633 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:41:09,645 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:09,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:41:09,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:09,657 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:41:09,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:09,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [854928906] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:41:09,735 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:41:09,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2024-03-11 22:41:09,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512169964]
[2024-03-11 22:41:09,736 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:41:09,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-03-11 22:41:09,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:41:09,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-03-11 22:41:09,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-03-11 22:41:10,429 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 189
[2024-03-11 22:41:10,430 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1200 transitions, 14935 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:10,430 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:41:10,430 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 189
[2024-03-11 22:41:10,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:41:15,133 INFO  L130       PetriNetUnfolder]: 9433/16444 cut-off events.
[2024-03-11 22:41:15,133 INFO  L131       PetriNetUnfolder]: For 133736/135548 co-relation queries the response was YES.
[2024-03-11 22:41:15,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 111367 conditions, 16444 events. 9433/16444 cut-off events. For 133736/135548 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 113865 event pairs, 1513 based on Foata normal form. 117/16068 useless extension candidates. Maximal degree in co-relation 108309. Up to 11866 conditions per place. 
[2024-03-11 22:41:15,281 INFO  L137   encePairwiseOnDemand]: 169/189 looper letters, 979 selfloop transitions, 544 changer transitions 0/1559 dead transitions.
[2024-03-11 22:41:15,281 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 1559 transitions, 22266 flow
[2024-03-11 22:41:15,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-11 22:41:15,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-11 22:41:15,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1231 transitions.
[2024-03-11 22:41:15,284 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4652305366591081
[2024-03-11 22:41:15,284 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1231 transitions.
[2024-03-11 22:41:15,284 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1231 transitions.
[2024-03-11 22:41:15,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:41:15,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1231 transitions.
[2024-03-11 22:41:15,286 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 87.92857142857143) internal successors, (1231), 14 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:15,289 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:15,289 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 189.0) internal successors, (2835), 15 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:15,289 INFO  L175             Difference]: Start difference. First operand has 179 places, 1200 transitions, 14935 flow. Second operand 14 states and 1231 transitions.
[2024-03-11 22:41:15,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 1559 transitions, 22266 flow
[2024-03-11 22:41:16,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1559 transitions, 21582 flow, removed 335 selfloop flow, removed 5 redundant places.
[2024-03-11 22:41:16,946 INFO  L231             Difference]: Finished difference. Result has 195 places, 1404 transitions, 18852 flow
[2024-03-11 22:41:16,947 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=14283, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18852, PETRI_PLACES=195, PETRI_TRANSITIONS=1404}
[2024-03-11 22:41:16,947 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2024-03-11 22:41:16,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1404 transitions, 18852 flow
[2024-03-11 22:41:16,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:16,948 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:41:16,948 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:41:16,955 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-11 22:41:17,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-11 22:41:17,150 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:41:17,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:41:17,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -2138907004, now seen corresponding path program 1 times
[2024-03-11 22:41:17,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:41:17,151 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091908915]
[2024-03-11 22:41:17,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:17,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:41:17,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:17,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:17,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:41:17,408 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091908915]
[2024-03-11 22:41:17,408 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091908915] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:41:17,409 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671600645]
[2024-03-11 22:41:17,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:17,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:17,409 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:41:17,410 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:41:17,412 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-11 22:41:17,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:17,537 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-11 22:41:17,540 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:41:17,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:41:17,585 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:41:17,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:41:17,678 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:41:17,710 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:41:17,749 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:41:17,791 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:41:17,848 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:41:17,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:17,903 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:41:17,924 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-11 22:41:17,944 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2024-03-11 22:41:17,967 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_865 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_865) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-11 22:41:18,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:18,059 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671600645] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:41:18,059 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:41:18,059 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23
[2024-03-11 22:41:18,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470326707]
[2024-03-11 22:41:18,059 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:41:18,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-11 22:41:18,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:41:18,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-11 22:41:18,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=374, Unknown=3, NotChecked=126, Total=600
[2024-03-11 22:41:18,222 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-11 22:41:18,223 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1404 transitions, 18852 flow. Second operand  has 25 states, 25 states have (on average 49.76) internal successors, (1244), 25 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:18,223 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:41:18,223 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-11 22:41:18,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:41:31,606 INFO  L130       PetriNetUnfolder]: 19486/32924 cut-off events.
[2024-03-11 22:41:31,606 INFO  L131       PetriNetUnfolder]: For 267892/267904 co-relation queries the response was YES.
[2024-03-11 22:41:31,826 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 227229 conditions, 32924 events. 19486/32924 cut-off events. For 267892/267904 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 245918 event pairs, 995 based on Foata normal form. 402/31275 useless extension candidates. Maximal degree in co-relation 217580. Up to 12556 conditions per place. 
[2024-03-11 22:41:31,979 INFO  L137   encePairwiseOnDemand]: 157/189 looper letters, 2064 selfloop transitions, 1241 changer transitions 2/3311 dead transitions.
[2024-03-11 22:41:31,980 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 3311 transitions, 46961 flow
[2024-03-11 22:41:31,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-11 22:41:31,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-11 22:41:31,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2284 transitions.
[2024-03-11 22:41:31,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.345275888133031
[2024-03-11 22:41:31,983 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2284 transitions.
[2024-03-11 22:41:31,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2284 transitions.
[2024-03-11 22:41:31,984 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:41:31,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2284 transitions.
[2024-03-11 22:41:31,987 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 65.25714285714285) internal successors, (2284), 35 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:31,992 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:31,993 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:31,993 INFO  L175             Difference]: Start difference. First operand has 195 places, 1404 transitions, 18852 flow. Second operand 35 states and 2284 transitions.
[2024-03-11 22:41:31,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 3311 transitions, 46961 flow
[2024-03-11 22:41:37,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 3311 transitions, 45962 flow, removed 294 selfloop flow, removed 5 redundant places.
[2024-03-11 22:41:37,322 INFO  L231             Difference]: Finished difference. Result has 249 places, 2550 transitions, 38089 flow
[2024-03-11 22:41:37,323 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=17894, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=38089, PETRI_PLACES=249, PETRI_TRANSITIONS=2550}
[2024-03-11 22:41:37,323 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 192 predicate places.
[2024-03-11 22:41:37,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 2550 transitions, 38089 flow
[2024-03-11 22:41:37,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 49.76) internal successors, (1244), 25 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:37,324 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:41:37,324 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:41:37,331 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-03-11 22:41:37,525 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-11 22:41:37,525 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:41:37,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:41:37,526 INFO  L85        PathProgramCache]: Analyzing trace with hash 781280382, now seen corresponding path program 2 times
[2024-03-11 22:41:37,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:41:37,527 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841536427]
[2024-03-11 22:41:37,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:37,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:41:37,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:37,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:37,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:41:37,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841536427]
[2024-03-11 22:41:37,796 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841536427] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:41:37,796 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662001786]
[2024-03-11 22:41:37,796 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:41:37,796 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:37,796 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:41:37,798 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:41:37,798 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-11 22:41:37,985 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:41:37,985 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:41:37,986 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-11 22:41:37,990 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:41:37,995 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:41:38,017 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:41:38,017 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:41:38,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:41:38,124 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:41:38,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:41:38,203 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:41:38,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:41:38,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:38,323 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:41:38,343 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-11 22:41:38,357 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-11 22:41:38,375 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-11 22:41:38,394 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_955 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)))))) is different from false
[2024-03-11 22:41:38,420 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_955) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-11 22:41:38,440 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:38,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-11 22:41:38,446 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:38,447 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-11 22:41:38,455 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-11 22:41:38,461 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:41:38,462 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-11 22:41:38,468 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:41:38,469 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-11 22:41:38,476 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:41:38,477 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-11 22:41:38,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:38,496 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [662001786] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:41:38,496 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:41:38,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-11 22:41:38,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917975317]
[2024-03-11 22:41:38,497 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:41:38,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:41:38,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:41:38,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:41:38,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=335, Unknown=5, NotChecked=210, Total=650
[2024-03-11 22:41:38,541 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189
[2024-03-11 22:41:38,543 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2550 transitions, 38089 flow. Second operand  has 26 states, 26 states have (on average 56.69230769230769) internal successors, (1474), 26 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:38,543 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:41:38,543 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189
[2024-03-11 22:41:38,543 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:42:03,955 INFO  L130       PetriNetUnfolder]: 27554/47417 cut-off events.
[2024-03-11 22:42:03,955 INFO  L131       PetriNetUnfolder]: For 1083404/1083480 co-relation queries the response was YES.
[2024-03-11 22:42:04,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 435499 conditions, 47417 events. 27554/47417 cut-off events. For 1083404/1083480 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 379853 event pairs, 1325 based on Foata normal form. 102/44318 useless extension candidates. Maximal degree in co-relation 428282. Up to 16722 conditions per place. 
[2024-03-11 22:42:04,732 INFO  L137   encePairwiseOnDemand]: 150/189 looper letters, 3124 selfloop transitions, 1195 changer transitions 1/4324 dead transitions.
[2024-03-11 22:42:04,733 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 4324 transitions, 73457 flow
[2024-03-11 22:42:04,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-11 22:42:04,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-11 22:42:04,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2470 transitions.
[2024-03-11 22:42:04,736 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37339380196523053
[2024-03-11 22:42:04,736 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2470 transitions.
[2024-03-11 22:42:04,736 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2470 transitions.
[2024-03-11 22:42:04,737 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:42:04,737 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2470 transitions.
[2024-03-11 22:42:04,740 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 70.57142857142857) internal successors, (2470), 35 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:04,744 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:04,745 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:04,745 INFO  L175             Difference]: Start difference. First operand has 249 places, 2550 transitions, 38089 flow. Second operand 35 states and 2470 transitions.
[2024-03-11 22:42:04,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 4324 transitions, 73457 flow
[2024-03-11 22:42:26,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 4324 transitions, 67262 flow, removed 3091 selfloop flow, removed 5 redundant places.
[2024-03-11 22:42:26,543 INFO  L231             Difference]: Finished difference. Result has 304 places, 3278 transitions, 49228 flow
[2024-03-11 22:42:26,545 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=34170, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=575, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=49228, PETRI_PLACES=304, PETRI_TRANSITIONS=3278}
[2024-03-11 22:42:26,545 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 247 predicate places.
[2024-03-11 22:42:26,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 3278 transitions, 49228 flow
[2024-03-11 22:42:26,546 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.69230769230769) internal successors, (1474), 26 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:26,546 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:42:26,546 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:42:26,553 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-11 22:42:26,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-11 22:42:26,748 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:42:26,748 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:42:26,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -718735195, now seen corresponding path program 1 times
[2024-03-11 22:42:26,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:42:26,749 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305830873]
[2024-03-11 22:42:26,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:42:26,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:42:26,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:42:27,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:42:27,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:42:27,017 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305830873]
[2024-03-11 22:42:27,017 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305830873] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:42:27,017 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758457828]
[2024-03-11 22:42:27,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:42:27,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:42:27,017 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:42:27,018 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:42:27,019 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-11 22:42:27,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:42:27,147 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-11 22:42:27,157 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:42:27,173 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:42:27,199 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:42:27,199 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:42:27,293 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:42:27,324 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-11 22:42:27,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:42:27,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:42:27,420 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:42:27,474 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:42:27,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:42:27,511 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:42:27,529 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)))) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-11 22:42:27,546 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-03-11 22:42:27,571 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-03-11 22:42:27,596 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1050 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1050) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)))))))) is different from false
[2024-03-11 22:42:27,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:42:27,687 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [758457828] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:42:27,687 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:42:27,687 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2024-03-11 22:42:27,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492404824]
[2024-03-11 22:42:27,688 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:42:27,688 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:42:27,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:42:27,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:42:27,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=375, Unknown=4, NotChecked=172, Total=650
[2024-03-11 22:42:27,838 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-11 22:42:27,839 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 3278 transitions, 49228 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:27,839 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:42:27,839 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-11 22:42:27,839 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:43:03,003 INFO  L130       PetriNetUnfolder]: 30325/52329 cut-off events.
[2024-03-11 22:43:03,003 INFO  L131       PetriNetUnfolder]: For 1505357/1505427 co-relation queries the response was YES.
[2024-03-11 22:43:03,753 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 525132 conditions, 52329 events. 30325/52329 cut-off events. For 1505357/1505427 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 428488 event pairs, 2512 based on Foata normal form. 451/49125 useless extension candidates. Maximal degree in co-relation 524892. Up to 18018 conditions per place. 
[2024-03-11 22:43:04,050 INFO  L137   encePairwiseOnDemand]: 157/189 looper letters, 2599 selfloop transitions, 1912 changer transitions 2/4517 dead transitions.
[2024-03-11 22:43:04,050 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 4517 transitions, 78237 flow
[2024-03-11 22:43:04,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-03-11 22:43:04,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2024-03-11 22:43:04,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2136 transitions.
[2024-03-11 22:43:04,054 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3424723424723425
[2024-03-11 22:43:04,054 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 2136 transitions.
[2024-03-11 22:43:04,054 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 2136 transitions.
[2024-03-11 22:43:04,054 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:43:04,054 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2136 transitions.
[2024-03-11 22:43:04,057 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 64.72727272727273) internal successors, (2136), 33 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:04,060 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 189.0) internal successors, (6426), 34 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:04,061 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 189.0) internal successors, (6426), 34 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:04,061 INFO  L175             Difference]: Start difference. First operand has 304 places, 3278 transitions, 49228 flow. Second operand 33 states and 2136 transitions.
[2024-03-11 22:43:04,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 4517 transitions, 78237 flow
[2024-03-11 22:43:27,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 4517 transitions, 76879 flow, removed 677 selfloop flow, removed 2 redundant places.
[2024-03-11 22:43:27,383 INFO  L231             Difference]: Finished difference. Result has 348 places, 3616 transitions, 59457 flow
[2024-03-11 22:43:27,386 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=48320, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1583, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=59457, PETRI_PLACES=348, PETRI_TRANSITIONS=3616}
[2024-03-11 22:43:27,386 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 291 predicate places.
[2024-03-11 22:43:27,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 348 places, 3616 transitions, 59457 flow
[2024-03-11 22:43:27,386 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:27,386 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:43:27,387 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:43:27,392 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-11 22:43:27,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-11 22:43:27,588 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:43:27,589 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:43:27,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 786019662, now seen corresponding path program 3 times
[2024-03-11 22:43:27,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:43:27,589 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749343583]
[2024-03-11 22:43:27,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:43:27,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:43:27,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:43:27,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:27,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:43:27,832 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749343583]
[2024-03-11 22:43:27,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749343583] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:43:27,832 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026452759]
[2024-03-11 22:43:27,832 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:43:27,832 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:43:27,832 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:43:27,834 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:43:27,834 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-11 22:43:27,971 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:43:27,971 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:43:27,973 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-11 22:43:27,976 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:43:27,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:43:28,011 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:43:28,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:43:28,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:43:28,123 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:43:28,161 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:43:28,237 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-11 22:43:28,285 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:43:28,285 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:43:28,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:28,323 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:43:28,350 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-03-11 22:43:28,365 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-11 22:43:28,380 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-03-11 22:43:28,397 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-03-11 22:43:28,415 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:43:28,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53
[2024-03-11 22:43:28,420 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:43:28,421 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 34
[2024-03-11 22:43:28,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-11 22:43:28,432 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:43:28,432 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2024-03-11 22:43:28,438 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:43:28,438 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2024-03-11 22:43:28,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:28,468 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026452759] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:43:28,468 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:43:28,468 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-11 22:43:28,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828938189]
[2024-03-11 22:43:28,468 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:43:28,468 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:43:28,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:43:28,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:43:28,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=382, Unknown=4, NotChecked=172, Total=650
[2024-03-11 22:43:28,499 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 189
[2024-03-11 22:43:28,500 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 3616 transitions, 59457 flow. Second operand  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:28,500 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:43:28,500 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 189
[2024-03-11 22:43:28,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:44:22,612 INFO  L130       PetriNetUnfolder]: 42962/75053 cut-off events.
[2024-03-11 22:44:22,612 INFO  L131       PetriNetUnfolder]: For 2566684/2566752 co-relation queries the response was YES.
[2024-03-11 22:44:23,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 809660 conditions, 75053 events. 42962/75053 cut-off events. For 2566684/2566752 co-relation queries the response was YES. Maximal size of possible extension queue 2147. Compared 658066 event pairs, 2280 based on Foata normal form. 175/69682 useless extension candidates. Maximal degree in co-relation 809321. Up to 28242 conditions per place. 
[2024-03-11 22:44:24,430 INFO  L137   encePairwiseOnDemand]: 158/189 looper letters, 3569 selfloop transitions, 1957 changer transitions 0/5530 dead transitions.
[2024-03-11 22:44:24,430 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 5530 transitions, 103499 flow
[2024-03-11 22:44:24,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-11 22:44:24,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-11 22:44:24,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2237 transitions.
[2024-03-11 22:44:24,438 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3818057689025431
[2024-03-11 22:44:24,438 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2237 transitions.
[2024-03-11 22:44:24,438 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2237 transitions.
[2024-03-11 22:44:24,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:44:24,440 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2237 transitions.
[2024-03-11 22:44:24,444 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 72.16129032258064) internal successors, (2237), 31 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:44:24,451 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:44:24,452 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 189.0) internal successors, (6048), 32 states have internal predecessors, (6048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:44:24,452 INFO  L175             Difference]: Start difference. First operand has 348 places, 3616 transitions, 59457 flow. Second operand 31 states and 2237 transitions.
[2024-03-11 22:44:24,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 5530 transitions, 103499 flow
[2024-03-11 22:45:16,097 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 5530 transitions, 102091 flow, removed 385 selfloop flow, removed 12 redundant places.
[2024-03-11 22:45:16,175 INFO  L231             Difference]: Finished difference. Result has 385 places, 4408 transitions, 81593 flow
[2024-03-11 22:45:16,177 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=58513, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=81593, PETRI_PLACES=385, PETRI_TRANSITIONS=4408}
[2024-03-11 22:45:16,178 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2024-03-11 22:45:16,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4408 transitions, 81593 flow
[2024-03-11 22:45:16,178 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.73076923076923) internal successors, (1475), 26 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:45:16,178 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:45:16,178 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:45:16,183 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-11 22:45:16,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-11 22:45:16,379 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:45:16,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:45:16,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 936627582, now seen corresponding path program 4 times
[2024-03-11 22:45:16,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:45:16,381 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444807857]
[2024-03-11 22:45:16,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:45:16,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:45:16,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:45:16,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:45:16,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:45:16,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444807857]
[2024-03-11 22:45:16,668 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444807857] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:45:16,669 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32533101]
[2024-03-11 22:45:16,669 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:45:16,669 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:45:16,669 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:45:16,670 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:45:16,672 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-11 22:45:16,878 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:45:16,878 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:45:16,880 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-11 22:45:16,896 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:45:16,903 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:45:16,926 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:45:16,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:45:17,056 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:45:17,087 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:45:17,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-03-11 22:45:17,192 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:45:17,193 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:45:17,240 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:45:17,241 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:45:17,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:45:17,284 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:45:17,312 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1226) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1226 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1226) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))))) is different from false
[2024-03-11 22:45:17,393 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1226 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1226) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-03-11 22:45:17,405 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:45:17,405 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41
[2024-03-11 22:45:17,411 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:45:17,411 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31
[2024-03-11 22:45:17,416 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-03-11 22:45:17,423 INFO  L321             Elim1Store]: treesize reduction 25, result has 3.8 percent of original size
[2024-03-11 22:45:17,423 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 1
[2024-03-11 22:45:17,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:45:17,559 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [32533101] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:45:17,559 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:45:17,559 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29
[2024-03-11 22:45:17,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304817284]
[2024-03-11 22:45:17,560 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:45:17,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-11 22:45:17,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:45:17,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-11 22:45:17,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=671, Unknown=11, NotChecked=110, Total=930
[2024-03-11 22:45:17,672 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-11 22:45:17,675 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 4408 transitions, 81593 flow. Second operand  has 31 states, 31 states have (on average 49.74193548387097) internal successors, (1542), 31 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:45:17,675 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:45:17,675 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-11 22:45:17,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:46:35,306 INFO  L130       PetriNetUnfolder]: 50913/89340 cut-off events.
[2024-03-11 22:46:35,306 INFO  L131       PetriNetUnfolder]: For 4447556/4447614 co-relation queries the response was YES.
[2024-03-11 22:46:37,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1040263 conditions, 89340 events. 50913/89340 cut-off events. For 4447556/4447614 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 811788 event pairs, 7653 based on Foata normal form. 167/86418 useless extension candidates. Maximal degree in co-relation 1039883. Up to 43791 conditions per place. 
[2024-03-11 22:46:37,800 INFO  L137   encePairwiseOnDemand]: 159/189 looper letters, 4439 selfloop transitions, 2022 changer transitions 14/6479 dead transitions.
[2024-03-11 22:46:37,800 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 6479 transitions, 137252 flow
[2024-03-11 22:46:37,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-11 22:46:37,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-11 22:46:37,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2104 transitions.
[2024-03-11 22:46:37,803 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3180650037792895
[2024-03-11 22:46:37,803 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2104 transitions.
[2024-03-11 22:46:37,804 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2104 transitions.
[2024-03-11 22:46:37,804 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:46:37,804 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2104 transitions.
[2024-03-11 22:46:37,806 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 60.114285714285714) internal successors, (2104), 35 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:46:37,810 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:46:37,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 189.0) internal successors, (6804), 36 states have internal predecessors, (6804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:46:37,811 INFO  L175             Difference]: Start difference. First operand has 385 places, 4408 transitions, 81593 flow. Second operand 35 states and 2104 transitions.
[2024-03-11 22:46:37,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 6479 transitions, 137252 flow
[2024-03-11 22:48:03,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 6479 transitions, 135611 flow, removed 664 selfloop flow, removed 6 redundant places.
[2024-03-11 22:48:03,604 INFO  L231             Difference]: Finished difference. Result has 434 places, 5545 transitions, 113379 flow
[2024-03-11 22:48:03,607 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=80229, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2952, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=113379, PETRI_PLACES=434, PETRI_TRANSITIONS=5545}
[2024-03-11 22:48:03,607 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 377 predicate places.
[2024-03-11 22:48:03,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 434 places, 5545 transitions, 113379 flow
[2024-03-11 22:48:03,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 49.74193548387097) internal successors, (1542), 31 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:48:03,607 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:48:03,607 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:48:03,614 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-11 22:48:03,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:48:03,809 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:48:03,809 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:48:03,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -62263474, now seen corresponding path program 5 times
[2024-03-11 22:48:03,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:48:03,810 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446422961]
[2024-03-11 22:48:03,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:48:03,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:48:03,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:48:04,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:48:04,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:48:04,028 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446422961]
[2024-03-11 22:48:04,029 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446422961] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:48:04,029 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296797310]
[2024-03-11 22:48:04,029 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 22:48:04,029 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:48:04,029 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:48:04,030 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:48:04,031 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-11 22:48:04,173 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:48:04,173 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:48:04,174 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-11 22:48:04,177 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:48:04,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:48:04,203 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:48:04,203 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:48:04,283 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:48:04,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-11 22:48:04,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:48:04,403 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:48:04,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:48:04,447 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:48:04,447 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:48:04,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:48:04,496 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:48:04,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:48:04,568 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296797310] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:48:04,568 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:48:04,569 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2024-03-11 22:48:04,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453902780]
[2024-03-11 22:48:04,569 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:48:04,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-11 22:48:04,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:48:04,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-11 22:48:04,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462
[2024-03-11 22:48:05,523 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189
[2024-03-11 22:48:05,524 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 5545 transitions, 113379 flow. Second operand  has 22 states, 22 states have (on average 80.81818181818181) internal successors, (1778), 22 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:48:05,524 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:48:05,524 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189
[2024-03-11 22:48:05,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:49:26,663 INFO  L130       PetriNetUnfolder]: 46532/87989 cut-off events.
[2024-03-11 22:49:26,663 INFO  L131       PetriNetUnfolder]: For 5143705/5162373 co-relation queries the response was YES.
[2024-03-11 22:49:28,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1042318 conditions, 87989 events. 46532/87989 cut-off events. For 5143705/5162373 co-relation queries the response was YES. Maximal size of possible extension queue 2924. Compared 884281 event pairs, 5797 based on Foata normal form. 1779/85439 useless extension candidates. Maximal degree in co-relation 1041862. Up to 32086 conditions per place. 
[2024-03-11 22:49:29,584 INFO  L137   encePairwiseOnDemand]: 163/189 looper letters, 2847 selfloop transitions, 3425 changer transitions 0/6506 dead transitions.
[2024-03-11 22:49:29,584 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 6506 transitions, 147449 flow
[2024-03-11 22:49:29,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-11 22:49:29,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-11 22:49:29,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2211 transitions.
[2024-03-11 22:49:29,587 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48743386243386244
[2024-03-11 22:49:29,587 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 2211 transitions.
[2024-03-11 22:49:29,587 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 2211 transitions.
[2024-03-11 22:49:29,587 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:49:29,587 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2211 transitions.
[2024-03-11 22:49:29,590 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 92.125) internal successors, (2211), 24 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:49:29,593 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 189.0) internal successors, (4725), 25 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:49:29,593 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 189.0) internal successors, (4725), 25 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:49:29,593 INFO  L175             Difference]: Start difference. First operand has 434 places, 5545 transitions, 113379 flow. Second operand 24 states and 2211 transitions.
[2024-03-11 22:49:29,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 6506 transitions, 147449 flow
[2024-03-11 22:51:13,667 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 6506 transitions, 145728 flow, removed 780 selfloop flow, removed 5 redundant places.
[2024-03-11 22:51:13,778 INFO  L231             Difference]: Finished difference. Result has 470 places, 6213 transitions, 141947 flow
[2024-03-11 22:51:13,782 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=111577, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2851, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=141947, PETRI_PLACES=470, PETRI_TRANSITIONS=6213}
[2024-03-11 22:51:13,782 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 413 predicate places.
[2024-03-11 22:51:13,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 470 places, 6213 transitions, 141947 flow
[2024-03-11 22:51:13,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 80.81818181818181) internal successors, (1778), 22 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:13,783 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:51:13,783 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:51:13,789 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-11 22:51:13,983 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:13,984 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:51:13,985 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:51:13,985 INFO  L85        PathProgramCache]: Analyzing trace with hash -328231415, now seen corresponding path program 1 times
[2024-03-11 22:51:13,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:51:13,985 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273959960]
[2024-03-11 22:51:13,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:13,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:51:14,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:14,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:14,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:51:14,225 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273959960]
[2024-03-11 22:51:14,225 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273959960] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:51:14,225 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548112856]
[2024-03-11 22:51:14,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:51:14,226 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:51:14,226 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:51:14,227 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:51:14,229 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-11 22:51:14,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:51:14,367 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-11 22:51:14,370 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:51:14,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-03-11 22:51:14,405 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:51:14,405 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-03-11 22:51:14,526 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:51:14,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:51:14,603 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:51:14,649 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:51:14,714 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:51:14,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:14,751 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:51:14,776 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)))) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-03-11 22:51:14,795 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-03-11 22:51:14,814 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)))))) is different from false
[2024-03-11 22:51:14,832 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0) .cse4 0)))) (and (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1419 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1419) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-03-11 22:51:14,845 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:14,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-03-11 22:51:14,850 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:51:14,850 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-03-11 22:51:14,853 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-03-11 22:51:14,859 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:51:14,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-11 22:51:14,864 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:51:14,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-11 22:51:14,869 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-11 22:51:14,869 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-11 22:51:14,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:51:14,918 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [548112856] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:51:14,919 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:51:14,919 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2024-03-11 22:51:14,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645512603]
[2024-03-11 22:51:14,919 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:51:14,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:51:14,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:51:14,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:51:14,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=379, Unknown=4, NotChecked=172, Total=650
[2024-03-11 22:51:15,062 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 189
[2024-03-11 22:51:15,064 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 6213 transitions, 141947 flow. Second operand  has 26 states, 26 states have (on average 49.88461538461539) internal successors, (1297), 26 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:51:15,064 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:51:15,064 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 189
[2024-03-11 22:51:15,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
