./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP --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 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:39,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:39,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 22:23:39,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:39,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:39,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:39,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:39,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:39,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:39,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:39,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:39,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:39,235 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:39,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:39,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:23:39,237 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:39,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:23:39,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:39,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:39,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:23:39,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:39,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:23:39,242 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 22:23:39,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:23:39,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:39,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:23:39,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:39,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:39,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:39,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:39,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:39,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:39,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:39,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:23:39,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:23:39,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:23:39,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:39,249 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:23:39,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:39,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:39,250 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:39,251 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2023-11-06 22:23:39,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:39,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:39,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:39,619 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:39,619 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:39,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-06 22:23:43,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:43,480 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:43,480 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-06 22:23:43,498 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/data/ede097719/b81e1fbd4bfb49d98beef2e0757e2e3a/FLAGb6d4e44a8 [2023-11-06 22:23:43,516 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/data/ede097719/b81e1fbd4bfb49d98beef2e0757e2e3a [2023-11-06 22:23:43,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:43,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:43,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:43,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:43,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:43,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:43" (1/1) ... [2023-11-06 22:23:43,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445b8558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:43, skipping insertion in model container [2023-11-06 22:23:43,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:43" (1/1) ... [2023-11-06 22:23:43,592 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:44,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:44,124 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:44,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:44,272 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:44,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44 WrapperNode [2023-11-06 22:23:44,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:44,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:44,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:44,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:44,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,352 INFO L138 Inliner]: procedures = 171, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 105 [2023-11-06 22:23:44,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:44,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:44,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:44,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:44,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:44,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:44,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:44,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:44,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (1/1) ... [2023-11-06 22:23:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:44,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:44,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:44,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecc358fd-82fb-4cca-9127-14ba3171a4b8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:44,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:23:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:23:44,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:23:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:23:44,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:23:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:23:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:23:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:44,489 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:23:44,645 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:44,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:44,917 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:45,006 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:45,006 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:23:45,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:45 BoogieIcfgContainer [2023-11-06 22:23:45,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:45,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:45,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:45,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:45,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:43" (1/3) ... [2023-11-06 22:23:45,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1555b1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:45, skipping insertion in model container [2023-11-06 22:23:45,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:44" (2/3) ... [2023-11-06 22:23:45,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1555b1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:45, skipping insertion in model container [2023-11-06 22:23:45,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:45" (3/3) ... [2023-11-06 22:23:45,024 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2023-11-06 22:23:45,066 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:23:45,076 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:45,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-06 22:23:45,077 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:23:45,159 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:23:45,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,280 INFO L124 PetriNetUnfolderBase]: 8/112 cut-off events. [2023-11-06 22:23:45,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:45,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 112 events. 8/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-11-06 22:23:45,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,300 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:23:45,313 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 206 flow [2023-11-06 22:23:45,356 INFO L124 PetriNetUnfolderBase]: 8/112 cut-off events. [2023-11-06 22:23:45,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:45,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 112 events. 8/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-11-06 22:23:45,362 INFO L119 LiptonReduction]: Number of co-enabled transitions 1876 [2023-11-06 22:23:50,646 INFO L134 LiptonReduction]: Checked pairs total: 2057 [2023-11-06 22:23:50,647 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-11-06 22:23:50,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:50,674 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;@557e32f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:50,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-06 22:23:50,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:23:50,679 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-11-06 22:23:50,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:50,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:50,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:23:50,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:23:50,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash 505878653, now seen corresponding path program 1 times [2023-11-06 22:23:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497605613] [2023-11-06 22:23:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:50,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497605613] [2023-11-06 22:23:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497605613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:50,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:50,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62691719] [2023-11-06 22:23:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:50,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:50,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 223 [2023-11-06 22:23:50,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-11-06 22:23:50,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:50,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 223 [2023-11-06 22:23:50,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:51,003 INFO L124 PetriNetUnfolderBase]: 7/19 cut-off events. [2023-11-06 22:23:51,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:51,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-11-06 22:23:51,005 INFO L140 encePairwiseOnDemand]: 214/223 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-06 22:23:51,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 34 flow [2023-11-06 22:23:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:23:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2023-11-06 22:23:51,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260089686098655 [2023-11-06 22:23:51,025 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2023-11-06 22:23:51,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2023-11-06 22:23:51,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:51,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2023-11-06 22:23:51,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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) [2023-11-06 22:23:51,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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) [2023-11-06 22:23:51,041 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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) [2023-11-06 22:23:51,043 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 38 flow. Second operand 2 states and 190 transitions. [2023-11-06 22:23:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 34 flow [2023-11-06 22:23:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:23:51,047 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 20 flow [2023-11-06 22:23:51,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2023-11-06 22:23:51,053 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, -8 predicate places. [2023-11-06 22:23:51,053 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 20 flow [2023-11-06 22:23:51,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-11-06 22:23:51,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:51,054 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-06 22:23:51,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:23:51,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-06 22:23:51,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1497718846, now seen corresponding path program 1 times [2023-11-06 22:23:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:51,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363001341] [2023-11-06 22:23:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:51,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:23:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:51,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:23:51,125 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:23:51,127 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-06 22:23:51,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2023-11-06 22:23:51,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2023-11-06 22:23:51,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2023-11-06 22:23:51,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2023-11-06 22:23:51,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2023-11-06 22:23:51,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2023-11-06 22:23:51,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2023-11-06 22:23:51,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2023-11-06 22:23:51,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2023-11-06 22:23:51,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2023-11-06 22:23:51,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2023-11-06 22:23:51,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2023-11-06 22:23:51,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2023-11-06 22:23:51,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2023-11-06 22:23:51,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2023-11-06 22:23:51,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2023-11-06 22:23:51,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:51,136 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:23:51,141 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:23:51,141 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:23:51,199 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:23:51,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,281 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2023-11-06 22:23:51,281 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:23:51,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 193 events. 15/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 399 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-11-06 22:23:51,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,296 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:23:51,297 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 169 transitions, 348 flow [2023-11-06 22:23:51,355 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2023-11-06 22:23:51,358 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:23:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 193 events. 15/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 399 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-11-06 22:23:51,372 INFO L119 LiptonReduction]: Number of co-enabled transitions 12864 [2023-11-06 22:23:54,399 INFO L134 LiptonReduction]: Checked pairs total: 39762 [2023-11-06 22:23:54,399 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-11-06 22:23:54,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:54,404 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;@557e32f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:54,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-06 22:23:54,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:23:54,409 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-06 22:23:54,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:23:54,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:54,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:54,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-06 22:23:54,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash 700855026, now seen corresponding path program 1 times [2023-11-06 22:23:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453625681] [2023-11-06 22:23:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:54,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:54,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453625681] [2023-11-06 22:23:54,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453625681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:54,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:54,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895346808] [2023-11-06 22:23:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:54,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:54,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 311 [2023-11-06 22:23:54,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 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) [2023-11-06 22:23:54,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:54,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 311 [2023-11-06 22:23:54,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:54,704 INFO L124 PetriNetUnfolderBase]: 257/768 cut-off events. [2023-11-06 22:23:54,704 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:23:54,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 768 events. 257/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4804 event pairs, 183 based on Foata normal form. 66/686 useless extension candidates. Maximal degree in co-relation 604. Up to 412 conditions per place. [2023-11-06 22:23:54,713 INFO L140 encePairwiseOnDemand]: 300/311 looper letters, 22 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-11-06 22:23:54,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 164 flow [2023-11-06 22:23:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:23:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2023-11-06 22:23:54,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128617363344051 [2023-11-06 22:23:54,723 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2023-11-06 22:23:54,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2023-11-06 22:23:54,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:54,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2023-11-06 22:23:54,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 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) [2023-11-06 22:23:54,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-11-06 22:23:54,738 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-11-06 22:23:54,738 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 142 flow. Second operand 2 states and 319 transitions. [2023-11-06 22:23:54,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 164 flow [2023-11-06 22:23:54,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:23:54,742 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 120 flow [2023-11-06 22:23:54,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2023-11-06 22:23:54,744 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2023-11-06 22:23:54,744 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 120 flow [2023-11-06 22:23:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 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) [2023-11-06 22:23:54,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:54,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:54,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:54,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-06 22:23:54,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash 251665846, now seen corresponding path program 1 times [2023-11-06 22:23:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165620802] [2023-11-06 22:23:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165620802] [2023-11-06 22:23:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165620802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972343474] [2023-11-06 22:23:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:55,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:55,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:55,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 311 [2023-11-06 22:23:55,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 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) [2023-11-06 22:23:55,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:55,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 311 [2023-11-06 22:23:55,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:55,894 INFO L124 PetriNetUnfolderBase]: 381/949 cut-off events. [2023-11-06 22:23:55,894 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-06 22:23:55,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 949 events. 381/949 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5854 event pairs, 79 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1602. Up to 275 conditions per place. [2023-11-06 22:23:55,906 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 65 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-11-06 22:23:55,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 366 flow [2023-11-06 22:23:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2023-11-06 22:23:55,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592711682743837 [2023-11-06 22:23:55,912 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2023-11-06 22:23:55,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2023-11-06 22:23:55,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:55,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2023-11-06 22:23:55,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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) [2023-11-06 22:23:55,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-11-06 22:23:55,927 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-11-06 22:23:55,927 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 120 flow. Second operand 6 states and 857 transitions. [2023-11-06 22:23:55,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 366 flow [2023-11-06 22:23:55,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:23:55,933 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 128 flow [2023-11-06 22:23:55,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-11-06 22:23:55,937 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2023-11-06 22:23:55,937 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 128 flow [2023-11-06 22:23:55,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 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) [2023-11-06 22:23:55,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:55,940 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 22:23:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:55,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-06 22:23:55,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash -149342972, now seen corresponding path program 1 times [2023-11-06 22:23:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734318927] [2023-11-06 22:23:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:55,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:23:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:56,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:23:56,002 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:23:56,002 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2023-11-06 22:23:56,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2023-11-06 22:23:56,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2023-11-06 22:23:56,003 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2023-11-06 22:23:56,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2023-11-06 22:23:56,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2023-11-06 22:23:56,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2023-11-06 22:23:56,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2023-11-06 22:23:56,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2023-11-06 22:23:56,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2023-11-06 22:23:56,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2023-11-06 22:23:56,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2023-11-06 22:23:56,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2023-11-06 22:23:56,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2023-11-06 22:23:56,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2023-11-06 22:23:56,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2023-11-06 22:23:56,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2023-11-06 22:23:56,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2023-11-06 22:23:56,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2023-11-06 22:23:56,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2023-11-06 22:23:56,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2023-11-06 22:23:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2023-11-06 22:23:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2023-11-06 22:23:56,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2023-11-06 22:23:56,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2023-11-06 22:23:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:56,028 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:23:56,029 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:23:56,029 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-06 22:23:56,083 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:23:56,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,156 INFO L124 PetriNetUnfolderBase]: 22/274 cut-off events. [2023-11-06 22:23:56,157 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:23:56,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 274 events. 22/274 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 214. Up to 8 conditions per place. [2023-11-06 22:23:56,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,170 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:23:56,170 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,171 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 237 transitions, 492 flow [2023-11-06 22:23:56,235 INFO L124 PetriNetUnfolderBase]: 22/274 cut-off events. [2023-11-06 22:23:56,235 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:23:56,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 274 events. 22/274 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 214. Up to 8 conditions per place. [2023-11-06 22:23:56,269 INFO L119 LiptonReduction]: Number of co-enabled transitions 32964 [2023-11-06 22:24:00,661 INFO L134 LiptonReduction]: Checked pairs total: 109579 [2023-11-06 22:24:00,662 INFO L136 LiptonReduction]: Total number of compositions: 205 [2023-11-06 22:24:00,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:00,675 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;@557e32f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:00,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-06 22:24:00,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:24:00,680 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-06 22:24:00,680 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:24:00,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:00,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:00,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-06 22:24:00,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1102847468, now seen corresponding path program 1 times [2023-11-06 22:24:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:00,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646794431] [2023-11-06 22:24:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646794431] [2023-11-06 22:24:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646794431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:00,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:24:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335900702] [2023-11-06 22:24:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:00,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:00,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 442 [2023-11-06 22:24:00,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 210 flow. Second operand has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 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) [2023-11-06 22:24:00,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:00,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 442 [2023-11-06 22:24:00,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:02,118 INFO L124 PetriNetUnfolderBase]: 3827/8372 cut-off events. [2023-11-06 22:24:02,119 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-06 22:24:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13880 conditions, 8372 events. 3827/8372 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 72227 event pairs, 2841 based on Foata normal form. 893/7657 useless extension candidates. Maximal degree in co-relation 3842. Up to 5206 conditions per place. [2023-11-06 22:24:02,267 INFO L140 encePairwiseOnDemand]: 426/442 looper letters, 32 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-06 22:24:02,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 242 flow [2023-11-06 22:24:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:24:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 446 transitions. [2023-11-06 22:24:02,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504524886877828 [2023-11-06 22:24:02,271 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 446 transitions. [2023-11-06 22:24:02,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 446 transitions. [2023-11-06 22:24:02,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:02,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 446 transitions. [2023-11-06 22:24:02,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.0) internal successors, (446), 2 states have internal predecessors, (446), 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) [2023-11-06 22:24:02,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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) [2023-11-06 22:24:02,279 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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) [2023-11-06 22:24:02,279 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 210 flow. Second operand 2 states and 446 transitions. [2023-11-06 22:24:02,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 242 flow [2023-11-06 22:24:02,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 240 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:02,289 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 176 flow [2023-11-06 22:24:02,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=176, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2023-11-06 22:24:02,290 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -12 predicate places. [2023-11-06 22:24:02,290 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 176 flow [2023-11-06 22:24:02,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 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) [2023-11-06 22:24:02,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:02,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:02,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:24:02,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-06 22:24:02,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 171460287, now seen corresponding path program 1 times [2023-11-06 22:24:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925131773] [2023-11-06 22:24:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925131773] [2023-11-06 22:24:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925131773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254823072] [2023-11-06 22:24:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:02,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:03,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-11-06 22:24:03,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 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) [2023-11-06 22:24:03,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:03,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-11-06 22:24:03,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:05,018 INFO L124 PetriNetUnfolderBase]: 5671/10995 cut-off events. [2023-11-06 22:24:05,018 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2023-11-06 22:24:05,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 10995 events. 5671/10995 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 91613 event pairs, 1191 based on Foata normal form. 0/9377 useless extension candidates. Maximal degree in co-relation 19090. Up to 3497 conditions per place. [2023-11-06 22:24:05,126 INFO L140 encePairwiseOnDemand]: 436/442 looper letters, 115 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2023-11-06 22:24:05,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 622 flow [2023-11-06 22:24:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-11-06 22:24:05,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687028657616893 [2023-11-06 22:24:05,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-11-06 22:24:05,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-11-06 22:24:05,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:05,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-11-06 22:24:05,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.16666666666666) internal successors, (1243), 6 states have internal predecessors, (1243), 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) [2023-11-06 22:24:05,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-06 22:24:05,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-06 22:24:05,154 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 176 flow. Second operand 6 states and 1243 transitions. [2023-11-06 22:24:05,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 622 flow [2023-11-06 22:24:05,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 163 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:05,164 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 184 flow [2023-11-06 22:24:05,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2023-11-06 22:24:05,168 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -8 predicate places. [2023-11-06 22:24:05,168 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 184 flow [2023-11-06 22:24:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 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) [2023-11-06 22:24:05,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:05,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:24:05,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-06 22:24:05,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1262077326, now seen corresponding path program 1 times [2023-11-06 22:24:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070520411] [2023-11-06 22:24:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070520411] [2023-11-06 22:24:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070520411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147753325] [2023-11-06 22:24:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:05,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:05,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 442 [2023-11-06 22:24:05,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2023-11-06 22:24:05,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:05,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 442 [2023-11-06 22:24:05,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:10,916 INFO L124 PetriNetUnfolderBase]: 24519/40244 cut-off events. [2023-11-06 22:24:10,916 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2023-11-06 22:24:11,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77279 conditions, 40244 events. 24519/40244 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 324655 event pairs, 8046 based on Foata normal form. 0/36061 useless extension candidates. Maximal degree in co-relation 77272. Up to 22183 conditions per place. [2023-11-06 22:24:11,346 INFO L140 encePairwiseOnDemand]: 421/442 looper letters, 77 selfloop transitions, 15 changer transitions 0/121 dead transitions. [2023-11-06 22:24:11,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 121 transitions, 464 flow [2023-11-06 22:24:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2023-11-06 22:24:11,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766214177978884 [2023-11-06 22:24:11,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2023-11-06 22:24:11,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2023-11-06 22:24:11,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:11,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2023-11-06 22:24:11,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2023-11-06 22:24:11,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-11-06 22:24:11,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-11-06 22:24:11,366 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 184 flow. Second operand 3 states and 632 transitions. [2023-11-06 22:24:11,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 121 transitions, 464 flow [2023-11-06 22:24:11,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:24:11,449 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 306 flow [2023-11-06 22:24:11,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2023-11-06 22:24:11,452 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -9 predicate places. [2023-11-06 22:24:11,453 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 306 flow [2023-11-06 22:24:11,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2023-11-06 22:24:11,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:11,454 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:11,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:24:11,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-06 22:24:11,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 94730216, now seen corresponding path program 1 times [2023-11-06 22:24:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:11,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546926241] [2023-11-06 22:24:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:24:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546926241] [2023-11-06 22:24:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546926241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:12,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282268297] [2023-11-06 22:24:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:12,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:12,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-11-06 22:24:12,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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) [2023-11-06 22:24:12,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:12,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-11-06 22:24:12,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:16,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,273 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 22:24:16,273 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 22:24:16,273 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-06 22:24:16,273 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-06 22:24:16,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 93#thr1EXITtrue, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,461 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-06 22:24:16,461 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,461 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,461 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:24:16,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 4#L706-1true, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,461 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 142#L705-6true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,462 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:24:16,462 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:24:16,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 110#L709-3true, 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,466 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-06 22:24:16,466 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:16,466 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:16,466 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:16,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,519 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-06 22:24:16,519 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-06 22:24:16,519 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-06 22:24:16,519 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-06 22:24:16,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][132], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 7#L706-2true, 131#L725-5true, 19#L713true, 246#(= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0), 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,633 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-06 22:24:16,634 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:24:16,634 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:24:16,634 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:24:16,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 93#thr1EXITtrue, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,667 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-06 22:24:16,667 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:16,668 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,668 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:16,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 4#L706-1true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,668 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-06 22:24:16,668 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,668 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:16,669 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:16,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 142#L705-6true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,669 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-06 22:24:16,669 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:24:16,669 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:16,669 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:16,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 110#L709-3true, 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,672 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-06 22:24:16,672 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-06 22:24:16,672 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-06 22:24:16,672 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-06 22:24:16,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][131], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 247#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0)), 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 92#L706-3true]) [2023-11-06 22:24:16,704 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-06 22:24:16,704 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:24:16,704 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:24:16,705 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:16,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][130], [thr1Thread2of3ForFork0InUse, 248#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 23#L706-4true]) [2023-11-06 22:24:16,917 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-06 22:24:16,917 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,917 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:24:16,917 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:16,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][132], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 7#L706-2true, 19#L713true, 246#(= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0), 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,948 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-06 22:24:16,949 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:24:16,949 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:24:16,949 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:24:16,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 126#L706-7true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,980 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-06 22:24:16,980 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:16,980 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:16,980 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:16,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 3#L706-5true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:16,988 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-06 22:24:16,988 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:24:16,989 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:24:16,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:24:17,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][131], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 247#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0)), 240#(= |#race~max~0| 0), 85#L713true, 19#L713true, 228#true, 92#L706-3true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,022 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-06 22:24:17,022 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:17,022 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:17,022 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:17,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 174#L707-1true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,048 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-06 22:24:17,048 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,049 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:17,049 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 115#L706-7true, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,054 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-06 22:24:17,055 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:17,055 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:24:17,055 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:17,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][130], [thr1Thread2of3ForFork0InUse, 248#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 23#L706-4true]) [2023-11-06 22:24:17,082 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-06 22:24:17,082 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,082 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:17,083 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:17,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [5#L707-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,106 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-06 22:24:17,106 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:17,106 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:24:17,106 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 126#L706-7true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,125 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-11-06 22:24:17,125 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:17,125 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-06 22:24:17,125 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-06 22:24:17,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 3#L706-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,132 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2023-11-06 22:24:17,133 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 22:24:17,133 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:24:17,133 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:24:17,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 174#L707-1true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,174 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-06 22:24:17,174 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:17,175 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:17,175 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 115#L706-7true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,180 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-11-06 22:24:17,180 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-06 22:24:17,180 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:17,180 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:24:17,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 5#L707-1true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-06 22:24:17,222 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-06 22:24:17,222 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,222 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 22:24:17,222 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-06 22:24:17,365 INFO L124 PetriNetUnfolderBase]: 21956/38205 cut-off events. [2023-11-06 22:24:17,365 INFO L125 PetriNetUnfolderBase]: For 9227/9889 co-relation queries the response was YES. [2023-11-06 22:24:17,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79321 conditions, 38205 events. 21956/38205 cut-off events. For 9227/9889 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 330812 event pairs, 4557 based on Foata normal form. 116/33930 useless extension candidates. Maximal degree in co-relation 79313. Up to 14765 conditions per place. [2023-11-06 22:24:17,772 INFO L140 encePairwiseOnDemand]: 436/442 looper letters, 122 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2023-11-06 22:24:17,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 802 flow [2023-11-06 22:24:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:24:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-11-06 22:24:17,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671945701357466 [2023-11-06 22:24:17,780 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-11-06 22:24:17,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-11-06 22:24:17,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:17,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-11-06 22:24:17,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 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) [2023-11-06 22:24:17,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-06 22:24:17,797 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-06 22:24:17,798 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 306 flow. Second operand 6 states and 1239 transitions. [2023-11-06 22:24:17,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 802 flow [2023-11-06 22:24:17,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 181 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:24:17,908 INFO L231 Difference]: Finished difference. Result has 87 places, 93 transitions, 284 flow [2023-11-06 22:24:17,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=87, PETRI_TRANSITIONS=93} [2023-11-06 22:24:17,910 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -7 predicate places. [2023-11-06 22:24:17,911 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 284 flow [2023-11-06 22:24:17,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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) [2023-11-06 22:24:17,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:17,912 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-06 22:24:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:24:17,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-06 22:24:17,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 580603578, now seen corresponding path program 1 times [2023-11-06 22:24:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27063658] [2023-11-06 22:24:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:17,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:17,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:17,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:17,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2023-11-06 22:24:17,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2023-11-06 22:24:17,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2023-11-06 22:24:17,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2023-11-06 22:24:17,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2023-11-06 22:24:17,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2023-11-06 22:24:17,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2023-11-06 22:24:17,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2023-11-06 22:24:17,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2023-11-06 22:24:17,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2023-11-06 22:24:17,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2023-11-06 22:24:17,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2023-11-06 22:24:17,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2023-11-06 22:24:17,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2023-11-06 22:24:17,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2023-11-06 22:24:17,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2023-11-06 22:24:17,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2023-11-06 22:24:17,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2023-11-06 22:24:17,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2023-11-06 22:24:17,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2023-11-06 22:24:17,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2023-11-06 22:24:17,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2023-11-06 22:24:17,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2023-11-06 22:24:17,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2023-11-06 22:24:17,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2023-11-06 22:24:17,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2023-11-06 22:24:17,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2023-11-06 22:24:17,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2023-11-06 22:24:17,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2023-11-06 22:24:17,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2023-11-06 22:24:17,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2023-11-06 22:24:17,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2023-11-06 22:24:17,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2023-11-06 22:24:17,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:24:17,976 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:24:17,977 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:24:17,977 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-06 22:24:18,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:24:18,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,143 INFO L124 PetriNetUnfolderBase]: 29/355 cut-off events. [2023-11-06 22:24:18,143 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:24:18,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 355 events. 29/355 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1188 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 282. Up to 10 conditions per place. [2023-11-06 22:24:18,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,155 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:24:18,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,157 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 305 transitions, 638 flow [2023-11-06 22:24:18,377 INFO L124 PetriNetUnfolderBase]: 29/355 cut-off events. [2023-11-06 22:24:18,377 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:24:18,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 355 events. 29/355 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1188 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 282. Up to 10 conditions per place. [2023-11-06 22:24:18,414 INFO L119 LiptonReduction]: Number of co-enabled transitions 62176 [2023-11-06 22:24:22,904 INFO L134 LiptonReduction]: Checked pairs total: 204173 [2023-11-06 22:24:22,904 INFO L136 LiptonReduction]: Total number of compositions: 249 [2023-11-06 22:24:22,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:22,907 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;@557e32f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:22,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-06 22:24:22,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:24:22,911 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-06 22:24:22,911 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:24:22,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:22,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:22,912 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-06 22:24:22,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1818905280, now seen corresponding path program 1 times [2023-11-06 22:24:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213080841] [2023-11-06 22:24:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213080841] [2023-11-06 22:24:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213080841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:24:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853185708] [2023-11-06 22:24:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:22,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 554 [2023-11-06 22:24:22,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 126 transitions, 280 flow. Second operand has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 states have internal predecessors, (516), 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) [2023-11-06 22:24:22,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:22,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 554 [2023-11-06 22:24:22,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:35,029 INFO L124 PetriNetUnfolderBase]: 48232/88538 cut-off events. [2023-11-06 22:24:35,029 INFO L125 PetriNetUnfolderBase]: For 7635/7635 co-relation queries the response was YES. [2023-11-06 22:24:35,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152538 conditions, 88538 events. 48232/88538 cut-off events. For 7635/7635 co-relation queries the response was YES. Maximal size of possible extension queue 2863. Compared 914578 event pairs, 36580 based on Foata normal form. 10747/83013 useless extension candidates. Maximal degree in co-relation 13952. Up to 60637 conditions per place. [2023-11-06 22:24:36,891 INFO L140 encePairwiseOnDemand]: 533/554 looper letters, 42 selfloop transitions, 0 changer transitions 0/105 dead transitions. [2023-11-06 22:24:36,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 322 flow [2023-11-06 22:24:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:24:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 573 transitions. [2023-11-06 22:24:36,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171480144404332 [2023-11-06 22:24:36,896 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 573 transitions. [2023-11-06 22:24:36,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 573 transitions. [2023-11-06 22:24:36,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:36,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 573 transitions. [2023-11-06 22:24:36,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 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) [2023-11-06 22:24:36,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 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) [2023-11-06 22:24:36,904 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 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) [2023-11-06 22:24:36,904 INFO L175 Difference]: Start difference. First operand has 123 places, 126 transitions, 280 flow. Second operand 2 states and 573 transitions. [2023-11-06 22:24:36,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 322 flow [2023-11-06 22:24:36,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 316 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:36,917 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 232 flow [2023-11-06 22:24:36,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2023-11-06 22:24:36,919 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -16 predicate places. [2023-11-06 22:24:36,920 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 232 flow [2023-11-06 22:24:36,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 states have internal predecessors, (516), 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) [2023-11-06 22:24:36,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:36,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:36,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:24:36,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-06 22:24:36,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash -551496657, now seen corresponding path program 1 times [2023-11-06 22:24:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:36,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527905674] [2023-11-06 22:24:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527905674] [2023-11-06 22:24:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527905674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:37,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615292976] [2023-11-06 22:24:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:37,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:37,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 554 [2023-11-06 22:24:37,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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) [2023-11-06 22:24:37,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:37,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 554 [2023-11-06 22:24:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand