./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc 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_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:00:37,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:00:37,381 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 12:00:37,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:00:37,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:00:37,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:00:37,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:00:37,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:00:37,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:00:37,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:00:37,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:00:37,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:00:37,445 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:00:37,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:00:37,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:00:37,449 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:00:37,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:00:37,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:00:37,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:00:37,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:00:37,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:00:37,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:00:37,453 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 12:00:37,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:00:37,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:00:37,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:00:37,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:00:37,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:00:37,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:00:37,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:00:37,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:37,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:00:37,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:00:37,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:00:37,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:00:37,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:00:37,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:00:37,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:00:37,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:00:37,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:00:37,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:00:37,466 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_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/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_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2023-11-26 12:00:37,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:00:37,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:00:37,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:00:37,826 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:00:37,827 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:00:37,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-26 12:00:41,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:00:41,813 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:00:41,814 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-26 12:00:41,830 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/data/77906724d/bb04567f9fb24fc0901226cc31ceae67/FLAGf543a6395 [2023-11-26 12:00:41,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/data/77906724d/bb04567f9fb24fc0901226cc31ceae67 [2023-11-26 12:00:41,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:00:41,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:00:41,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:41,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:00:41,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:00:41,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:41" (1/1) ... [2023-11-26 12:00:41,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea77119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:41, skipping insertion in model container [2023-11-26 12:00:41,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:00:41" (1/1) ... [2023-11-26 12:00:41,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:00:42,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:42,220 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:00:42,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:00:42,290 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:00:42,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42 WrapperNode [2023-11-26 12:00:42,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:00:42,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:42,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:00:42,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:00:42,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,444 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 417 [2023-11-26 12:00:42,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:00:42,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:00:42,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:00:42,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:00:42,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:00:42,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:00:42,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:00:42,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:00:42,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (1/1) ... [2023-11-26 12:00:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:00:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:00:42,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:00:42,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce2ff90f-5ed1-4f8a-a9e0-f04c7febd1e0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:00:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:00:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:00:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 12:00:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 12:00:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 12:00:42,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 12:00:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 12:00:42,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 12:00:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 12:00:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 12:00:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 12:00:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 12:00:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:00:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:00:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:00:42,698 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:00:42,897 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:00:42,902 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:00:43,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:00:43,965 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:00:43,972 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-26 12:00:43,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:43 BoogieIcfgContainer [2023-11-26 12:00:43,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:00:43,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:00:43,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:00:43,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:00:43,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:00:41" (1/3) ... [2023-11-26 12:00:43,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f47e990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:43, skipping insertion in model container [2023-11-26 12:00:43,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:00:42" (2/3) ... [2023-11-26 12:00:43,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f47e990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:00:43, skipping insertion in model container [2023-11-26 12:00:43,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:00:43" (3/3) ... [2023-11-26 12:00:43,991 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-11-26 12:00:44,003 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:00:44,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:00:44,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-26 12:00:44,026 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:00:44,249 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 12:00:44,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 529 places, 548 transitions, 1117 flow [2023-11-26 12:00:44,600 INFO L124 PetriNetUnfolderBase]: 29/545 cut-off events. [2023-11-26 12:00:44,601 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:00:44,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 545 events. 29/545 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 954 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2023-11-26 12:00:44,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 529 places, 548 transitions, 1117 flow [2023-11-26 12:00:44,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 495 transitions, 1008 flow [2023-11-26 12:00:44,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:00:44,657 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=LoopHeads, 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;@7bf8560e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:00:44,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-26 12:00:44,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:00:44,664 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-26 12:00:44,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:00:44,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:44,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:44,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:44,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1740169790, now seen corresponding path program 1 times [2023-11-26 12:00:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740637175] [2023-11-26 12:00:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:44,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:44,925 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-26 12:00:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740637175] [2023-11-26 12:00:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740637175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:44,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:44,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894347148] [2023-11-26 12:00:44,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:44,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:44,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:45,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 548 [2023-11-26 12:00:45,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 495 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-26 12:00:45,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:45,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 548 [2023-11-26 12:00:45,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:45,521 INFO L124 PetriNetUnfolderBase]: 33/1079 cut-off events. [2023-11-26 12:00:45,521 INFO L125 PetriNetUnfolderBase]: For 33/38 co-relation queries the response was YES. [2023-11-26 12:00:45,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1079 events. 33/1079 cut-off events. For 33/38 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5558 event pairs, 15 based on Foata normal form. 38/973 useless extension candidates. Maximal degree in co-relation 847. Up to 55 conditions per place. [2023-11-26 12:00:45,539 INFO L140 encePairwiseOnDemand]: 525/548 looper letters, 15 selfloop transitions, 2 changer transitions 6/474 dead transitions. [2023-11-26 12:00:45,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 474 transitions, 1000 flow [2023-11-26 12:00:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2023-11-26 12:00:45,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.944647201946472 [2023-11-26 12:00:45,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1553 transitions. [2023-11-26 12:00:45,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1553 transitions. [2023-11-26 12:00:45,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:45,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1553 transitions. [2023-11-26 12:00:45,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.6666666666666) internal successors, (1553), 3 states have internal predecessors, (1553), 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-26 12:00:45,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:45,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:45,601 INFO L175 Difference]: Start difference. First operand has 479 places, 495 transitions, 1008 flow. Second operand 3 states and 1553 transitions. [2023-11-26 12:00:45,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 474 transitions, 1000 flow [2023-11-26 12:00:45,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 474 transitions, 988 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 12:00:45,627 INFO L231 Difference]: Finished difference. Result has 474 places, 468 transitions, 946 flow [2023-11-26 12:00:45,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=474, PETRI_TRANSITIONS=468} [2023-11-26 12:00:45,635 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -5 predicate places. [2023-11-26 12:00:45,635 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 468 transitions, 946 flow [2023-11-26 12:00:45,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-26 12:00:45,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:45,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:00:45,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:45,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1036921209, now seen corresponding path program 1 times [2023-11-26 12:00:45,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495286227] [2023-11-26 12:00:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:45,772 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-26 12:00:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:45,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495286227] [2023-11-26 12:00:45,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495286227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122691090] [2023-11-26 12:00:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:45,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:45,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 548 [2023-11-26 12:00:45,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 468 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 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-26 12:00:45,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:45,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 548 [2023-11-26 12:00:45,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:46,506 INFO L124 PetriNetUnfolderBase]: 100/2698 cut-off events. [2023-11-26 12:00:46,507 INFO L125 PetriNetUnfolderBase]: For 14/31 co-relation queries the response was YES. [2023-11-26 12:00:46,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 2698 events. 100/2698 cut-off events. For 14/31 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 20020 event pairs, 56 based on Foata normal form. 0/2352 useless extension candidates. Maximal degree in co-relation 2837. Up to 152 conditions per place. [2023-11-26 12:00:46,580 INFO L140 encePairwiseOnDemand]: 541/548 looper letters, 18 selfloop transitions, 1 changer transitions 0/462 dead transitions. [2023-11-26 12:00:46,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 462 transitions, 972 flow [2023-11-26 12:00:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1522 transitions. [2023-11-26 12:00:46,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9257907542579076 [2023-11-26 12:00:46,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1522 transitions. [2023-11-26 12:00:46,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1522 transitions. [2023-11-26 12:00:46,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:46,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1522 transitions. [2023-11-26 12:00:46,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-26 12:00:46,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:46,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:46,602 INFO L175 Difference]: Start difference. First operand has 474 places, 468 transitions, 946 flow. Second operand 3 states and 1522 transitions. [2023-11-26 12:00:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 462 transitions, 972 flow [2023-11-26 12:00:46,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 462 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:46,614 INFO L231 Difference]: Finished difference. Result has 462 places, 462 transitions, 932 flow [2023-11-26 12:00:46,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=462, PETRI_TRANSITIONS=462} [2023-11-26 12:00:46,616 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -17 predicate places. [2023-11-26 12:00:46,616 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 462 transitions, 932 flow [2023-11-26 12:00:46,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 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-26 12:00:46,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:46,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:46,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:00:46,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:46,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1056744078, now seen corresponding path program 1 times [2023-11-26 12:00:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:46,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314979911] [2023-11-26 12:00:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:47,435 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-26 12:00:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314979911] [2023-11-26 12:00:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314979911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:00:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696064179] [2023-11-26 12:00:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:47,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:00:47,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:47,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:00:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:00:48,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 548 [2023-11-26 12:00:48,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 462 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 441.5) internal successors, (2649), 6 states have internal predecessors, (2649), 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-26 12:00:48,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:48,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 548 [2023-11-26 12:00:48,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:56,338 INFO L124 PetriNetUnfolderBase]: 7047/28402 cut-off events. [2023-11-26 12:00:56,339 INFO L125 PetriNetUnfolderBase]: For 206/840 co-relation queries the response was YES. [2023-11-26 12:00:56,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38179 conditions, 28402 events. 7047/28402 cut-off events. For 206/840 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 329806 event pairs, 5840 based on Foata normal form. 0/24782 useless extension candidates. Maximal degree in co-relation 38148. Up to 9728 conditions per place. [2023-11-26 12:00:56,761 INFO L140 encePairwiseOnDemand]: 530/548 looper letters, 66 selfloop transitions, 15 changer transitions 0/459 dead transitions. [2023-11-26 12:00:56,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 459 transitions, 1088 flow [2023-11-26 12:00:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:00:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:00:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2724 transitions. [2023-11-26 12:00:56,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8284671532846716 [2023-11-26 12:00:56,775 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2724 transitions. [2023-11-26 12:00:56,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2724 transitions. [2023-11-26 12:00:56,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:56,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2724 transitions. [2023-11-26 12:00:56,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 454.0) internal successors, (2724), 6 states have internal predecessors, (2724), 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-26 12:00:56,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:00:56,806 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:00:56,806 INFO L175 Difference]: Start difference. First operand has 462 places, 462 transitions, 932 flow. Second operand 6 states and 2724 transitions. [2023-11-26 12:00:56,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 459 transitions, 1088 flow [2023-11-26 12:00:56,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 459 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:00:56,821 INFO L231 Difference]: Finished difference. Result has 463 places, 459 transitions, 955 flow [2023-11-26 12:00:56,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=463, PETRI_TRANSITIONS=459} [2023-11-26 12:00:56,824 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -16 predicate places. [2023-11-26 12:00:56,824 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 459 transitions, 955 flow [2023-11-26 12:00:56,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 441.5) internal successors, (2649), 6 states have internal predecessors, (2649), 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-26 12:00:56,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:56,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:56,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:00:56,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:56,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 227499759, now seen corresponding path program 1 times [2023-11-26 12:00:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733400323] [2023-11-26 12:00:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:56,911 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-26 12:00:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733400323] [2023-11-26 12:00:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733400323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042712004] [2023-11-26 12:00:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:56,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:56,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:56,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-26 12:00:56,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 459 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:56,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:56,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-26 12:00:56,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:57,304 INFO L124 PetriNetUnfolderBase]: 16/883 cut-off events. [2023-11-26 12:00:57,304 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 12:00:57,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 883 events. 16/883 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2934 event pairs, 5 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 901. Up to 25 conditions per place. [2023-11-26 12:00:57,314 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/458 dead transitions. [2023-11-26 12:00:57,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 458 transitions, 979 flow [2023-11-26 12:00:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-26 12:00:57,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-26 12:00:57,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:57,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 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-26 12:00:57,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:57,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:57,339 INFO L175 Difference]: Start difference. First operand has 463 places, 459 transitions, 955 flow. Second operand 3 states and 1541 transitions. [2023-11-26 12:00:57,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 458 transitions, 979 flow [2023-11-26 12:00:57,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 458 transitions, 949 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 12:00:57,354 INFO L231 Difference]: Finished difference. Result has 459 places, 458 transitions, 927 flow [2023-11-26 12:00:57,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=927, PETRI_PLACES=459, PETRI_TRANSITIONS=458} [2023-11-26 12:00:57,358 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -20 predicate places. [2023-11-26 12:00:57,359 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 458 transitions, 927 flow [2023-11-26 12:00:57,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:57,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:57,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:57,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:00:57,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:57,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 395981782, now seen corresponding path program 1 times [2023-11-26 12:00:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:57,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130778127] [2023-11-26 12:00:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:57,476 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-26 12:00:57,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130778127] [2023-11-26 12:00:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130778127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552643214] [2023-11-26 12:00:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:57,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:57,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-26 12:00:57,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 458 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:57,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:57,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-26 12:00:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:57,688 INFO L124 PetriNetUnfolderBase]: 14/626 cut-off events. [2023-11-26 12:00:57,688 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 12:00:57,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 626 events. 14/626 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1727 event pairs, 7 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 630. Up to 25 conditions per place. [2023-11-26 12:00:57,698 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2023-11-26 12:00:57,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 457 transitions, 951 flow [2023-11-26 12:00:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-26 12:00:57,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-26 12:00:57,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:57,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-26 12:00:57,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 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-26 12:00:57,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:57,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:57,730 INFO L175 Difference]: Start difference. First operand has 459 places, 458 transitions, 927 flow. Second operand 3 states and 1541 transitions. [2023-11-26 12:00:57,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 457 transitions, 951 flow [2023-11-26 12:00:57,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 457 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:57,743 INFO L231 Difference]: Finished difference. Result has 458 places, 457 transitions, 925 flow [2023-11-26 12:00:57,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=458, PETRI_TRANSITIONS=457} [2023-11-26 12:00:57,748 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -21 predicate places. [2023-11-26 12:00:57,748 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 457 transitions, 925 flow [2023-11-26 12:00:57,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:57,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:57,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:57,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:00:57,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:57,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1774229213, now seen corresponding path program 1 times [2023-11-26 12:00:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397985054] [2023-11-26 12:00:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:57,867 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-26 12:00:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:57,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397985054] [2023-11-26 12:00:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397985054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:57,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425257354] [2023-11-26 12:00:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:57,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-26 12:00:57,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 457 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:57,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:57,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-26 12:00:57,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:58,069 INFO L124 PetriNetUnfolderBase]: 13/691 cut-off events. [2023-11-26 12:00:58,069 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2023-11-26 12:00:58,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 691 events. 13/691 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1718 event pairs, 4 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 692. Up to 23 conditions per place. [2023-11-26 12:00:58,078 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2023-11-26 12:00:58,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 456 transitions, 949 flow [2023-11-26 12:00:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-26 12:00:58,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-26 12:00:58,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-26 12:00:58,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-26 12:00:58,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:58,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-26 12:00:58,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 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-26 12:00:58,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:58,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:58,108 INFO L175 Difference]: Start difference. First operand has 458 places, 457 transitions, 925 flow. Second operand 3 states and 1541 transitions. [2023-11-26 12:00:58,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 456 transitions, 949 flow [2023-11-26 12:00:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 456 transitions, 945 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:58,124 INFO L231 Difference]: Finished difference. Result has 457 places, 456 transitions, 923 flow [2023-11-26 12:00:58,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=457, PETRI_TRANSITIONS=456} [2023-11-26 12:00:58,130 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -22 predicate places. [2023-11-26 12:00:58,130 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 456 transitions, 923 flow [2023-11-26 12:00:58,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-26 12:00:58,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:58,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:00:58,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:58,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1400620447, now seen corresponding path program 1 times [2023-11-26 12:00:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613536525] [2023-11-26 12:00:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:58,237 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-26 12:00:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613536525] [2023-11-26 12:00:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613536525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:58,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036159188] [2023-11-26 12:00:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:58,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:58,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:58,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-26 12:00:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 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-26 12:00:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-26 12:00:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:58,410 INFO L124 PetriNetUnfolderBase]: 15/571 cut-off events. [2023-11-26 12:00:58,410 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2023-11-26 12:00:58,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 571 events. 15/571 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1553 event pairs, 2 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 581. Up to 14 conditions per place. [2023-11-26 12:00:58,417 INFO L140 encePairwiseOnDemand]: 543/548 looper letters, 10 selfloop transitions, 3 changer transitions 0/456 dead transitions. [2023-11-26 12:00:58,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 456 transitions, 951 flow [2023-11-26 12:00:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1548 transitions. [2023-11-26 12:00:58,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2023-11-26 12:00:58,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1548 transitions. [2023-11-26 12:00:58,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1548 transitions. [2023-11-26 12:00:58,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:58,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1548 transitions. [2023-11-26 12:00:58,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 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-26 12:00:58,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:58,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:58,520 INFO L175 Difference]: Start difference. First operand has 457 places, 456 transitions, 923 flow. Second operand 3 states and 1548 transitions. [2023-11-26 12:00:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 456 transitions, 951 flow [2023-11-26 12:00:58,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:58,542 INFO L231 Difference]: Finished difference. Result has 455 places, 454 transitions, 921 flow [2023-11-26 12:00:58,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=455, PETRI_TRANSITIONS=454} [2023-11-26 12:00:58,544 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -24 predicate places. [2023-11-26 12:00:58,544 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 921 flow [2023-11-26 12:00:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 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-26 12:00:58,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:58,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:58,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:00:58,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:58,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1671445373, now seen corresponding path program 1 times [2023-11-26 12:00:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633434538] [2023-11-26 12:00:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:58,641 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-26 12:00:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633434538] [2023-11-26 12:00:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633434538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832754200] [2023-11-26 12:00:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:58,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:58,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-26 12:00:58,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-26 12:00:58,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:58,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-26 12:00:58,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:58,969 INFO L124 PetriNetUnfolderBase]: 31/1134 cut-off events. [2023-11-26 12:00:58,969 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-26 12:00:58,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 1134 events. 31/1134 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4904 event pairs, 2 based on Foata normal form. 1/1022 useless extension candidates. Maximal degree in co-relation 1178. Up to 46 conditions per place. [2023-11-26 12:00:58,984 INFO L140 encePairwiseOnDemand]: 544/548 looper letters, 16 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2023-11-26 12:00:58,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 459 transitions, 972 flow [2023-11-26 12:00:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2023-11-26 12:00:58,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.944647201946472 [2023-11-26 12:00:58,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1553 transitions. [2023-11-26 12:00:58,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1553 transitions. [2023-11-26 12:00:58,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:58,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1553 transitions. [2023-11-26 12:00:58,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.6666666666666) internal successors, (1553), 3 states have internal predecessors, (1553), 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-26 12:00:59,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:59,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:59,004 INFO L175 Difference]: Start difference. First operand has 455 places, 454 transitions, 921 flow. Second operand 3 states and 1553 transitions. [2023-11-26 12:00:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 459 transitions, 972 flow [2023-11-26 12:00:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 966 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:00:59,018 INFO L231 Difference]: Finished difference. Result has 454 places, 454 transitions, 925 flow [2023-11-26 12:00:59,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=454, PETRI_TRANSITIONS=454} [2023-11-26 12:00:59,019 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -25 predicate places. [2023-11-26 12:00:59,020 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 454 transitions, 925 flow [2023-11-26 12:00:59,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-26 12:00:59,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:59,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:59,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:00:59,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:59,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash -971748554, now seen corresponding path program 1 times [2023-11-26 12:00:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297941441] [2023-11-26 12:00:59,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:59,105 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-26 12:00:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297941441] [2023-11-26 12:00:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297941441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485566795] [2023-11-26 12:00:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:59,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:59,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-26 12:00:59,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 454 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-26 12:00:59,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:59,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-26 12:00:59,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:00:59,395 INFO L124 PetriNetUnfolderBase]: 25/807 cut-off events. [2023-11-26 12:00:59,395 INFO L125 PetriNetUnfolderBase]: For 16/37 co-relation queries the response was YES. [2023-11-26 12:00:59,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 807 events. 25/807 cut-off events. For 16/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2962 event pairs, 3 based on Foata normal form. 4/735 useless extension candidates. Maximal degree in co-relation 835. Up to 21 conditions per place. [2023-11-26 12:00:59,411 INFO L140 encePairwiseOnDemand]: 543/548 looper letters, 9 selfloop transitions, 2 changer transitions 4/454 dead transitions. [2023-11-26 12:00:59,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 454 transitions, 951 flow [2023-11-26 12:00:59,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:00:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:00:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2023-11-26 12:00:59,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9409975669099757 [2023-11-26 12:00:59,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1547 transitions. [2023-11-26 12:00:59,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1547 transitions. [2023-11-26 12:00:59,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:00:59,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1547 transitions. [2023-11-26 12:00:59,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 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-26 12:00:59,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:59,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:00:59,439 INFO L175 Difference]: Start difference. First operand has 454 places, 454 transitions, 925 flow. Second operand 3 states and 1547 transitions. [2023-11-26 12:00:59,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 454 transitions, 951 flow [2023-11-26 12:00:59,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 454 transitions, 951 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:00:59,455 INFO L231 Difference]: Finished difference. Result has 454 places, 448 transitions, 917 flow [2023-11-26 12:00:59,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=454, PETRI_TRANSITIONS=448} [2023-11-26 12:00:59,458 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -25 predicate places. [2023-11-26 12:00:59,458 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 448 transitions, 917 flow [2023-11-26 12:00:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-26 12:00:59,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:00:59,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:00:59,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:00:59,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:00:59,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:00:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1842414664, now seen corresponding path program 1 times [2023-11-26 12:00:59,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:00:59,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192163037] [2023-11-26 12:00:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:00:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:00:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:00:59,572 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-26 12:00:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:00:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192163037] [2023-11-26 12:00:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192163037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:00:59,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:00:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:00:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670006461] [2023-11-26 12:00:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:00:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:00:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:00:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:00:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:00:59,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-26 12:00:59,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 448 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-26 12:00:59,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:00:59,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-26 12:00:59,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:00,159 INFO L124 PetriNetUnfolderBase]: 73/1928 cut-off events. [2023-11-26 12:01:00,159 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2023-11-26 12:01:00,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1928 events. 73/1928 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11837 event pairs, 6 based on Foata normal form. 0/1727 useless extension candidates. Maximal degree in co-relation 2048. Up to 93 conditions per place. [2023-11-26 12:01:00,185 INFO L140 encePairwiseOnDemand]: 544/548 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2023-11-26 12:01:00,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 452 transitions, 963 flow [2023-11-26 12:01:00,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1552 transitions. [2023-11-26 12:01:00,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2023-11-26 12:01:00,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1552 transitions. [2023-11-26 12:01:00,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1552 transitions. [2023-11-26 12:01:00,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:00,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1552 transitions. [2023-11-26 12:01:00,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 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-26 12:01:00,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:01:00,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:01:00,208 INFO L175 Difference]: Start difference. First operand has 454 places, 448 transitions, 917 flow. Second operand 3 states and 1552 transitions. [2023-11-26 12:01:00,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 452 transitions, 963 flow [2023-11-26 12:01:00,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 452 transitions, 959 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:01:00,221 INFO L231 Difference]: Finished difference. Result has 449 places, 448 transitions, 923 flow [2023-11-26 12:01:00,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=449, PETRI_TRANSITIONS=448} [2023-11-26 12:01:00,223 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -30 predicate places. [2023-11-26 12:01:00,223 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 923 flow [2023-11-26 12:01:00,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-26 12:01:00,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:00,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:00,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:01:00,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:00,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1346113913, now seen corresponding path program 1 times [2023-11-26 12:01:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258731185] [2023-11-26 12:01:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:00,543 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-26 12:01:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258731185] [2023-11-26 12:01:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258731185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139498709] [2023-11-26 12:01:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:00,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:01,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-26 12:01:01,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 448 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 489.14285714285717) internal successors, (3424), 7 states have internal predecessors, (3424), 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-26 12:01:01,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:01,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-26 12:01:01,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:01,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] thread3EXIT-->L88-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 572#true, 574#(= |#race~B~0| 0), 565#(= |#race~A~0| 0), 577#true, 538#(= |#race~N~0| 0), Black: 563#true, 325#L88-7true]) [2023-11-26 12:01:01,973 INFO L294 olderBase$Statistics]: this new event has 424 ancestors and is cut-off event [2023-11-26 12:01:01,973 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is cut-off event [2023-11-26 12:01:01,973 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is cut-off event [2023-11-26 12:01:01,974 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2023-11-26 12:01:01,976 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1475] thread3EXIT-->L88-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 572#true, 574#(= |#race~B~0| 0), 565#(= |#race~A~0| 0), 577#true, 538#(= |#race~N~0| 0), Black: 563#true, 325#L88-7true]) [2023-11-26 12:01:01,977 INFO L294 olderBase$Statistics]: this new event has 328 ancestors and is not cut-off event [2023-11-26 12:01:01,977 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is not cut-off event [2023-11-26 12:01:01,977 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is not cut-off event [2023-11-26 12:01:01,977 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is not cut-off event [2023-11-26 12:01:01,978 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2023-11-26 12:01:02,021 INFO L124 PetriNetUnfolderBase]: 60/2172 cut-off events. [2023-11-26 12:01:02,021 INFO L125 PetriNetUnfolderBase]: For 28/80 co-relation queries the response was YES. [2023-11-26 12:01:02,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 2172 events. 60/2172 cut-off events. For 28/80 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 12000 event pairs, 14 based on Foata normal form. 4/1988 useless extension candidates. Maximal degree in co-relation 2381. Up to 68 conditions per place. [2023-11-26 12:01:02,059 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/491 dead transitions. [2023-11-26 12:01:02,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 491 transitions, 1181 flow [2023-11-26 12:01:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:01:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:01:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-26 12:01:02,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-26 12:01:02,083 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-26 12:01:02,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-26 12:01:02,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:02,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-26 12:01:02,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 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-26 12:01:02,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:02,131 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:02,132 INFO L175 Difference]: Start difference. First operand has 449 places, 448 transitions, 923 flow. Second operand 10 states and 4933 transitions. [2023-11-26 12:01:02,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 491 transitions, 1181 flow [2023-11-26 12:01:02,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 491 transitions, 1181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:02,149 INFO L231 Difference]: Finished difference. Result has 462 places, 473 transitions, 1115 flow [2023-11-26 12:01:02,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1115, PETRI_PLACES=462, PETRI_TRANSITIONS=473} [2023-11-26 12:01:02,152 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -17 predicate places. [2023-11-26 12:01:02,152 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 473 transitions, 1115 flow [2023-11-26 12:01:02,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.14285714285717) internal successors, (3424), 7 states have internal predecessors, (3424), 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-26 12:01:02,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:02,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:02,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:01:02,157 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:02,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -694292208, now seen corresponding path program 1 times [2023-11-26 12:01:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437452545] [2023-11-26 12:01:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:02,269 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-26 12:01:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437452545] [2023-11-26 12:01:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437452545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:01:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986581274] [2023-11-26 12:01:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:02,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:01:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:02,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:01:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:01:02,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-26 12:01:02,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 473 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-26 12:01:02,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:02,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-26 12:01:02,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:03,126 INFO L124 PetriNetUnfolderBase]: 102/2166 cut-off events. [2023-11-26 12:01:03,126 INFO L125 PetriNetUnfolderBase]: For 90/112 co-relation queries the response was YES. [2023-11-26 12:01:03,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 2166 events. 102/2166 cut-off events. For 90/112 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 12663 event pairs, 2 based on Foata normal form. 6/1990 useless extension candidates. Maximal degree in co-relation 2459. Up to 124 conditions per place. [2023-11-26 12:01:03,152 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 14 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2023-11-26 12:01:03,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 475 transitions, 1152 flow [2023-11-26 12:01:03,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:01:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:01:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1550 transitions. [2023-11-26 12:01:03,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9428223844282239 [2023-11-26 12:01:03,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1550 transitions. [2023-11-26 12:01:03,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1550 transitions. [2023-11-26 12:01:03,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:03,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1550 transitions. [2023-11-26 12:01:03,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 516.6666666666666) internal successors, (1550), 3 states have internal predecessors, (1550), 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-26 12:01:03,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:01:03,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 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-26 12:01:03,178 INFO L175 Difference]: Start difference. First operand has 462 places, 473 transitions, 1115 flow. Second operand 3 states and 1550 transitions. [2023-11-26 12:01:03,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 475 transitions, 1152 flow [2023-11-26 12:01:03,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 475 transitions, 1152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:03,198 INFO L231 Difference]: Finished difference. Result has 463 places, 472 transitions, 1118 flow [2023-11-26 12:01:03,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=463, PETRI_TRANSITIONS=472} [2023-11-26 12:01:03,200 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -16 predicate places. [2023-11-26 12:01:03,200 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 472 transitions, 1118 flow [2023-11-26 12:01:03,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 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-26 12:01:03,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:03,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:01:03,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:03,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2010669904, now seen corresponding path program 1 times [2023-11-26 12:01:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136607860] [2023-11-26 12:01:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:04,374 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-26 12:01:04,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:04,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136607860] [2023-11-26 12:01:04,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136607860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:04,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:04,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132871697] [2023-11-26 12:01:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:04,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:04,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-26 12:01:04,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 472 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 493.6666666666667) internal successors, (2962), 6 states have internal predecessors, (2962), 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-26 12:01:04,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:04,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-26 12:01:04,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:06,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [Black: 572#true, 42#L67-27true, 565#(= |#race~A~0| 0), 577#true, Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 563#true, 604#true, Black: 599#true, 296#L87-7true]) [2023-11-26 12:01:06,915 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-26 12:01:06,916 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:06,916 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-26 12:01:06,916 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:07,348 INFO L124 PetriNetUnfolderBase]: 320/5425 cut-off events. [2023-11-26 12:01:07,348 INFO L125 PetriNetUnfolderBase]: For 98/434 co-relation queries the response was YES. [2023-11-26 12:01:07,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 5425 events. 320/5425 cut-off events. For 98/434 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 44374 event pairs, 24 based on Foata normal form. 31/4954 useless extension candidates. Maximal degree in co-relation 6261. Up to 403 conditions per place. [2023-11-26 12:01:07,465 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 32 selfloop transitions, 21 changer transitions 0/495 dead transitions. [2023-11-26 12:01:07,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 495 transitions, 1273 flow [2023-11-26 12:01:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:01:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:01:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3006 transitions. [2023-11-26 12:01:07,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9142335766423357 [2023-11-26 12:01:07,486 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3006 transitions. [2023-11-26 12:01:07,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3006 transitions. [2023-11-26 12:01:07,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:07,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3006 transitions. [2023-11-26 12:01:07,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 501.0) internal successors, (3006), 6 states have internal predecessors, (3006), 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-26 12:01:07,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:07,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:07,513 INFO L175 Difference]: Start difference. First operand has 463 places, 472 transitions, 1118 flow. Second operand 6 states and 3006 transitions. [2023-11-26 12:01:07,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 495 transitions, 1273 flow [2023-11-26 12:01:07,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 495 transitions, 1273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:07,534 INFO L231 Difference]: Finished difference. Result has 473 places, 492 transitions, 1260 flow [2023-11-26 12:01:07,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1260, PETRI_PLACES=473, PETRI_TRANSITIONS=492} [2023-11-26 12:01:07,536 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -6 predicate places. [2023-11-26 12:01:07,537 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 492 transitions, 1260 flow [2023-11-26 12:01:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 493.6666666666667) internal successors, (2962), 6 states have internal predecessors, (2962), 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-26 12:01:07,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:07,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:07,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:01:07,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:07,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1538783012, now seen corresponding path program 1 times [2023-11-26 12:01:07,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216633360] [2023-11-26 12:01:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:07,847 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-26 12:01:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216633360] [2023-11-26 12:01:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216633360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:07,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180706887] [2023-11-26 12:01:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:07,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:08,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-26 12:01:08,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 492 transitions, 1260 flow. Second operand has 7 states, 7 states have (on average 489.2857142857143) internal successors, (3425), 7 states have internal predecessors, (3425), 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-26 12:01:08,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:08,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-26 12:01:08,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:09,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, 42#L67-27true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-26 12:01:09,170 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 12:01:09,170 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2023-11-26 12:01:09,170 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2023-11-26 12:01:09,171 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-26 12:01:09,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, 42#L67-27true, 154#L62true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-26 12:01:09,184 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2023-11-26 12:01:09,184 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-26 12:01:09,185 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-26 12:01:09,185 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-26 12:01:09,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 202#L67-28true]) [2023-11-26 12:01:09,187 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2023-11-26 12:01:09,187 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-26 12:01:09,187 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-26 12:01:09,187 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-26 12:01:09,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 202#L67-28true]) [2023-11-26 12:01:09,199 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-26 12:01:09,199 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-26 12:01:09,200 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-26 12:01:09,200 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-26 12:01:09,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), 49#L86-7true, Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 413#L67-29true]) [2023-11-26 12:01:09,202 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-26 12:01:09,202 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-26 12:01:09,202 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-26 12:01:09,203 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-26 12:01:09,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 538#(= |#race~N~0| 0), 49#L86-7true, Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 413#L67-29true]) [2023-11-26 12:01:09,215 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-26 12:01:09,215 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-26 12:01:09,215 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-26 12:01:09,215 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-26 12:01:09,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), 577#true, Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, 400#L67-30true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-26 12:01:09,218 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-26 12:01:09,218 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-26 12:01:09,218 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-26 12:01:09,219 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-26 12:01:09,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), 577#true, Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 400#L67-30true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 49#L86-7true, 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-26 12:01:09,230 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-26 12:01:09,230 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2023-11-26 12:01:09,230 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2023-11-26 12:01:09,230 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2023-11-26 12:01:10,113 INFO L124 PetriNetUnfolderBase]: 233/3855 cut-off events. [2023-11-26 12:01:10,114 INFO L125 PetriNetUnfolderBase]: For 252/363 co-relation queries the response was YES. [2023-11-26 12:01:10,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 3855 events. 233/3855 cut-off events. For 252/363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 28229 event pairs, 68 based on Foata normal form. 9/3481 useless extension candidates. Maximal degree in co-relation 4617. Up to 213 conditions per place. [2023-11-26 12:01:10,180 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/512 dead transitions. [2023-11-26 12:01:10,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 512 transitions, 1492 flow [2023-11-26 12:01:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:01:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:01:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-26 12:01:10,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-26 12:01:10,202 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-26 12:01:10,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-26 12:01:10,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:10,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-26 12:01:10,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 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-26 12:01:10,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:10,245 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:10,246 INFO L175 Difference]: Start difference. First operand has 473 places, 492 transitions, 1260 flow. Second operand 10 states and 4933 transitions. [2023-11-26 12:01:10,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 512 transitions, 1492 flow [2023-11-26 12:01:10,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 512 transitions, 1492 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:10,266 INFO L231 Difference]: Finished difference. Result has 484 places, 494 transitions, 1365 flow [2023-11-26 12:01:10,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1365, PETRI_PLACES=484, PETRI_TRANSITIONS=494} [2023-11-26 12:01:10,268 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 5 predicate places. [2023-11-26 12:01:10,269 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 494 transitions, 1365 flow [2023-11-26 12:01:10,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.2857142857143) internal successors, (3425), 7 states have internal predecessors, (3425), 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-26 12:01:10,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:10,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:10,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:01:10,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:10,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1085727542, now seen corresponding path program 1 times [2023-11-26 12:01:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982955666] [2023-11-26 12:01:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:10,560 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-26 12:01:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982955666] [2023-11-26 12:01:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982955666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:01:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782684773] [2023-11-26 12:01:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:10,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:01:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:01:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:01:11,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-26 12:01:11,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 494 transitions, 1365 flow. Second operand has 7 states, 7 states have (on average 489.42857142857144) internal successors, (3426), 7 states have internal predecessors, (3426), 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-26 12:01:11,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:11,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-26 12:01:11,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:12,734 INFO L124 PetriNetUnfolderBase]: 266/4410 cut-off events. [2023-11-26 12:01:12,734 INFO L125 PetriNetUnfolderBase]: For 321/348 co-relation queries the response was YES. [2023-11-26 12:01:12,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 4410 events. 266/4410 cut-off events. For 321/348 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 35860 event pairs, 36 based on Foata normal form. 3/4058 useless extension candidates. Maximal degree in co-relation 5474. Up to 209 conditions per place. [2023-11-26 12:01:12,801 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/514 dead transitions. [2023-11-26 12:01:12,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 514 transitions, 1597 flow [2023-11-26 12:01:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:01:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:01:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-26 12:01:12,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-26 12:01:12,819 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-26 12:01:12,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-26 12:01:12,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:12,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-26 12:01:12,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 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-26 12:01:12,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:12,848 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 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-26 12:01:12,848 INFO L175 Difference]: Start difference. First operand has 484 places, 494 transitions, 1365 flow. Second operand 10 states and 4933 transitions. [2023-11-26 12:01:12,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 514 transitions, 1597 flow [2023-11-26 12:01:12,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 514 transitions, 1524 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-26 12:01:12,867 INFO L231 Difference]: Finished difference. Result has 488 places, 496 transitions, 1397 flow [2023-11-26 12:01:12,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1397, PETRI_PLACES=488, PETRI_TRANSITIONS=496} [2023-11-26 12:01:12,869 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 9 predicate places. [2023-11-26 12:01:12,870 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 496 transitions, 1397 flow [2023-11-26 12:01:12,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.42857142857144) internal successors, (3426), 7 states have internal predecessors, (3426), 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-26 12:01:12,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:12,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:12,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:01:12,872 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:12,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1383619303, now seen corresponding path program 1 times [2023-11-26 12:01:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:12,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119657391] [2023-11-26 12:01:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:13,726 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-26 12:01:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119657391] [2023-11-26 12:01:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119657391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:13,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198786300] [2023-11-26 12:01:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:13,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:14,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-26 12:01:14,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 496 transitions, 1397 flow. Second operand has 6 states, 6 states have (on average 493.8333333333333) internal successors, (2963), 6 states have internal predecessors, (2963), 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-26 12:01:14,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:14,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-26 12:01:14,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:15,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][419], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), 656#true, 604#true, Black: 599#true, 296#L87-7true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, 616#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:15,223 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-26 12:01:15,223 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:15,223 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-26 12:01:15,223 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:15,738 INFO L124 PetriNetUnfolderBase]: 388/5410 cut-off events. [2023-11-26 12:01:15,738 INFO L125 PetriNetUnfolderBase]: For 707/847 co-relation queries the response was YES. [2023-11-26 12:01:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 5410 events. 388/5410 cut-off events. For 707/847 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 46311 event pairs, 8 based on Foata normal form. 44/5027 useless extension candidates. Maximal degree in co-relation 7111. Up to 472 conditions per place. [2023-11-26 12:01:15,841 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 47 selfloop transitions, 37 changer transitions 0/534 dead transitions. [2023-11-26 12:01:15,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 534 transitions, 1739 flow [2023-11-26 12:01:15,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:01:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:01:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3005 transitions. [2023-11-26 12:01:15,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9139294403892944 [2023-11-26 12:01:15,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3005 transitions. [2023-11-26 12:01:15,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3005 transitions. [2023-11-26 12:01:15,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:15,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3005 transitions. [2023-11-26 12:01:15,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 500.8333333333333) internal successors, (3005), 6 states have internal predecessors, (3005), 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-26 12:01:15,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:15,871 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:15,871 INFO L175 Difference]: Start difference. First operand has 488 places, 496 transitions, 1397 flow. Second operand 6 states and 3005 transitions. [2023-11-26 12:01:15,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 534 transitions, 1739 flow [2023-11-26 12:01:15,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 534 transitions, 1666 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-26 12:01:15,891 INFO L231 Difference]: Finished difference. Result has 491 places, 532 transitions, 1666 flow [2023-11-26 12:01:15,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1666, PETRI_PLACES=491, PETRI_TRANSITIONS=532} [2023-11-26 12:01:15,893 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 12 predicate places. [2023-11-26 12:01:15,893 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 532 transitions, 1666 flow [2023-11-26 12:01:15,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 493.8333333333333) internal successors, (2963), 6 states have internal predecessors, (2963), 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-26 12:01:15,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:15,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:15,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:01:15,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:15,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash -844920033, now seen corresponding path program 1 times [2023-11-26 12:01:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122337679] [2023-11-26 12:01:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:16,712 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-26 12:01:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122337679] [2023-11-26 12:01:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122337679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:16,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:16,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415517275] [2023-11-26 12:01:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:16,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:16,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:17,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-26 12:01:17,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 532 transitions, 1666 flow. Second operand has 6 states, 6 states have (on average 494.0) internal successors, (2964), 6 states have internal predecessors, (2964), 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-26 12:01:17,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:17,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-26 12:01:17,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:01:18,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][426], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 296#L87-7true, Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,572 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-26 12:01:18,572 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:18,572 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-26 12:01:18,572 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-26 12:01:18,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][424], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 256#L88-2true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,627 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-26 12:01:18,627 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-26 12:01:18,627 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-26 12:01:18,627 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-26 12:01:18,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][427], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 465#L88-3true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,648 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2023-11-26 12:01:18,648 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-26 12:01:18,648 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-26 12:01:18,648 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-26 12:01:18,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][425], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), 521#L88-4true, Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,669 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2023-11-26 12:01:18,669 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-26 12:01:18,669 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-26 12:01:18,669 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-26 12:01:18,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][423], [Black: 572#true, 42#L67-27true, 218#L88-5true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,687 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2023-11-26 12:01:18,687 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-26 12:01:18,688 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-26 12:01:18,688 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-26 12:01:18,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][423], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 589#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 324#L88-6true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-26 12:01:18,709 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2023-11-26 12:01:18,709 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-26 12:01:18,709 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-26 12:01:18,709 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-26 12:01:19,218 INFO L124 PetriNetUnfolderBase]: 493/6094 cut-off events. [2023-11-26 12:01:19,218 INFO L125 PetriNetUnfolderBase]: For 2088/2355 co-relation queries the response was YES. [2023-11-26 12:01:19,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8829 conditions, 6094 events. 493/6094 cut-off events. For 2088/2355 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 53318 event pairs, 12 based on Foata normal form. 84/5709 useless extension candidates. Maximal degree in co-relation 8768. Up to 568 conditions per place. [2023-11-26 12:01:19,330 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 78 selfloop transitions, 53 changer transitions 0/585 dead transitions. [2023-11-26 12:01:19,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 585 transitions, 2323 flow [2023-11-26 12:01:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:01:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:01:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3004 transitions. [2023-11-26 12:01:19,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9136253041362531 [2023-11-26 12:01:19,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3004 transitions. [2023-11-26 12:01:19,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3004 transitions. [2023-11-26 12:01:19,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:01:19,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3004 transitions. [2023-11-26 12:01:19,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 500.6666666666667) internal successors, (3004), 6 states have internal predecessors, (3004), 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-26 12:01:19,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:19,355 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 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-26 12:01:19,355 INFO L175 Difference]: Start difference. First operand has 491 places, 532 transitions, 1666 flow. Second operand 6 states and 3004 transitions. [2023-11-26 12:01:19,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 585 transitions, 2323 flow [2023-11-26 12:01:19,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 585 transitions, 2323 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 12:01:19,376 INFO L231 Difference]: Finished difference. Result has 501 places, 584 transitions, 2304 flow [2023-11-26 12:01:19,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2304, PETRI_PLACES=501, PETRI_TRANSITIONS=584} [2023-11-26 12:01:19,378 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 22 predicate places. [2023-11-26 12:01:19,378 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 584 transitions, 2304 flow [2023-11-26 12:01:19,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.0) internal successors, (2964), 6 states have internal predecessors, (2964), 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-26 12:01:19,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:01:19,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:01:19,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:01:19,380 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-26 12:01:19,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:01:19,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1992841587, now seen corresponding path program 1 times [2023-11-26 12:01:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:01:19,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784539397] [2023-11-26 12:01:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:01:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:01:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:01:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-26 12:01:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:01:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784539397] [2023-11-26 12:01:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784539397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:01:20,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:01:20,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:01:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882568583] [2023-11-26 12:01:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:01:20,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:01:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:01:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:01:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:01:20,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 548 [2023-11-26 12:01:20,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 584 transitions, 2304 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 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-26 12:01:20,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:01:20,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 548 [2023-11-26 12:01:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand