./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-word-trans.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_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya --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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:33:30,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:33:30,420 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 05:33:30,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:33:30,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:33:30,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:33:30,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:33:30,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:33:30,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:33:30,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:33:30,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:33:30,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:33:30,452 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:33:30,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:33:30,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:33:30,453 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:33:30,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:33:30,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:33:30,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:33:30,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:33:30,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:33:30,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:33:30,457 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 05:33:30,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:33:30,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:33:30,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:33:30,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:33:30,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:33:30,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:33:30,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:33:30,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:33:30,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:33:30,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:33:30,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:33:30,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:33:30,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:33:30,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:33:30,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:33:30,462 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:33:30,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:33:30,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:33:30,463 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_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/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_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2023-11-29 05:33:30,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:33:30,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:33:30,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:33:30,681 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:33:30,682 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:33:30,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2023-11-29 05:33:33,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:33:33,583 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:33:33,584 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2023-11-29 05:33:33,591 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/data/cd3cae8c6/0903c36858ff4040bff64d1971293418/FLAGb5a48cec4 [2023-11-29 05:33:33,602 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/data/cd3cae8c6/0903c36858ff4040bff64d1971293418 [2023-11-29 05:33:33,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:33:33,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:33:33,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:33:33,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:33:33,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:33:33,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196300d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33, skipping insertion in model container [2023-11-29 05:33:33,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:33:33,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:33:33,828 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:33:33,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:33:33,888 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:33:33,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33 WrapperNode [2023-11-29 05:33:33,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:33:33,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:33:33,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:33:33,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:33:33,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,944 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 277 [2023-11-29 05:33:33,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:33:33,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:33:33,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:33:33,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:33:33,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:33,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:34,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:34,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:34,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:33:34,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:33:34,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:33:34,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:33:34,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (1/1) ... [2023-11-29 05:33:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:33:34,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:34,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:33:34,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:33:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:33:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:33:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 05:33:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 05:33:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 05:33:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 05:33:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 05:33:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 05:33:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 05:33:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 05:33:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 05:33:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:33:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:33:34,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:33:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:33:34,099 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:33:34,230 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:33:34,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:33:35,005 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:33:35,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:33:35,029 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 05:33:35,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:33:35 BoogieIcfgContainer [2023-11-29 05:33:35,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:33:35,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:33:35,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:33:35,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:33:35,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:33:33" (1/3) ... [2023-11-29 05:33:35,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344c5475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:33:35, skipping insertion in model container [2023-11-29 05:33:35,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:33:33" (2/3) ... [2023-11-29 05:33:35,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344c5475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:33:35, skipping insertion in model container [2023-11-29 05:33:35,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:33:35" (3/3) ... [2023-11-29 05:33:35,040 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2023-11-29 05:33:35,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:33:35,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:33:35,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2023-11-29 05:33:35,055 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:33:35,191 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 05:33:35,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 653 places, 676 transitions, 1373 flow [2023-11-29 05:33:35,501 INFO L124 PetriNetUnfolderBase]: 33/673 cut-off events. [2023-11-29 05:33:35,501 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 05:33:35,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 673 events. 33/673 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1775 event pairs, 0 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2023-11-29 05:33:35,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 653 places, 676 transitions, 1373 flow [2023-11-29 05:33:35,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 625 places, 646 transitions, 1310 flow [2023-11-29 05:33:35,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:33:35,554 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;@2aee649b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:33:35,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2023-11-29 05:33:35,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:33:35,559 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-29 05:33:35,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:33:35,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:35,560 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] [2023-11-29 05:33:35,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:35,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1738776393, now seen corresponding path program 1 times [2023-11-29 05:33:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402065005] [2023-11-29 05:33:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:35,774 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-29 05:33:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402065005] [2023-11-29 05:33:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402065005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889870402] [2023-11-29 05:33:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:35,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:35,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:33:35,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 646 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:35,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:35,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:33:35,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:36,320 INFO L124 PetriNetUnfolderBase]: 51/1121 cut-off events. [2023-11-29 05:33:36,320 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 05:33:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1121 events. 51/1121 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5657 event pairs, 12 based on Foata normal form. 30/947 useless extension candidates. Maximal degree in co-relation 839. Up to 38 conditions per place. [2023-11-29 05:33:36,358 INFO L140 encePairwiseOnDemand]: 661/676 looper letters, 13 selfloop transitions, 2 changer transitions 6/633 dead transitions. [2023-11-29 05:33:36,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 633 transitions, 1314 flow [2023-11-29 05:33:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1963 transitions. [2023-11-29 05:33:36,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2023-11-29 05:33:36,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1963 transitions. [2023-11-29 05:33:36,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1963 transitions. [2023-11-29 05:33:36,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:36,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1963 transitions. [2023-11-29 05:33:36,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 05:33:36,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:36,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:36,411 INFO L175 Difference]: Start difference. First operand has 625 places, 646 transitions, 1310 flow. Second operand 3 states and 1963 transitions. [2023-11-29 05:33:36,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 633 transitions, 1314 flow [2023-11-29 05:33:36,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 633 transitions, 1302 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:33:36,435 INFO L231 Difference]: Finished difference. Result has 620 places, 627 transitions, 1264 flow [2023-11-29 05:33:36,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=620, PETRI_TRANSITIONS=627} [2023-11-29 05:33:36,442 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -5 predicate places. [2023-11-29 05:33:36,443 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 627 transitions, 1264 flow [2023-11-29 05:33:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:36,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:36,445 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] [2023-11-29 05:33:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:33:36,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:36,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1655201067, now seen corresponding path program 1 times [2023-11-29 05:33:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869293313] [2023-11-29 05:33:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:36,508 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-29 05:33:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869293313] [2023-11-29 05:33:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869293313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:36,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:36,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:36,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104040055] [2023-11-29 05:33:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:36,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:36,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:36,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:33:36,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 627 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:36,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:36,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:33:36,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:36,974 INFO L124 PetriNetUnfolderBase]: 79/1514 cut-off events. [2023-11-29 05:33:36,974 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 05:33:36,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1514 events. 79/1514 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9250 event pairs, 20 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1546. Up to 50 conditions per place. [2023-11-29 05:33:37,006 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/626 dead transitions. [2023-11-29 05:33:37,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 626 transitions, 1292 flow [2023-11-29 05:33:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1951 transitions. [2023-11-29 05:33:37,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9620315581854043 [2023-11-29 05:33:37,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:37,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:33:37,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,030 INFO L175 Difference]: Start difference. First operand has 620 places, 627 transitions, 1264 flow. Second operand 3 states and 1951 transitions. [2023-11-29 05:33:37,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 626 transitions, 1292 flow [2023-11-29 05:33:37,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 626 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:37,045 INFO L231 Difference]: Finished difference. Result has 613 places, 626 transitions, 1262 flow [2023-11-29 05:33:37,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1262, PETRI_PLACES=613, PETRI_TRANSITIONS=626} [2023-11-29 05:33:37,047 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -12 predicate places. [2023-11-29 05:33:37,047 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 626 transitions, 1262 flow [2023-11-29 05:33:37,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:37,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:37,049 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] [2023-11-29 05:33:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:33:37,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:37,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 688136627, now seen corresponding path program 1 times [2023-11-29 05:33:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792734042] [2023-11-29 05:33:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:37,106 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-29 05:33:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792734042] [2023-11-29 05:33:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792734042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782860765] [2023-11-29 05:33:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:37,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:37,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:33:37,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 626 transitions, 1262 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:37,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:37,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:33:37,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:37,462 INFO L124 PetriNetUnfolderBase]: 79/1501 cut-off events. [2023-11-29 05:33:37,462 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 05:33:37,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1501 events. 79/1501 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8405 event pairs, 20 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1517. Up to 50 conditions per place. [2023-11-29 05:33:37,479 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/625 dead transitions. [2023-11-29 05:33:37,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 625 transitions, 1290 flow [2023-11-29 05:33:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1951 transitions. [2023-11-29 05:33:37,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9620315581854043 [2023-11-29 05:33:37,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:37,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1951 transitions. [2023-11-29 05:33:37,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:33:37,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,496 INFO L175 Difference]: Start difference. First operand has 613 places, 626 transitions, 1262 flow. Second operand 3 states and 1951 transitions. [2023-11-29 05:33:37,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 625 transitions, 1290 flow [2023-11-29 05:33:37,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 625 transitions, 1286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:37,505 INFO L231 Difference]: Finished difference. Result has 612 places, 625 transitions, 1260 flow [2023-11-29 05:33:37,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=612, PETRI_TRANSITIONS=625} [2023-11-29 05:33:37,507 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -13 predicate places. [2023-11-29 05:33:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 612 places, 625 transitions, 1260 flow [2023-11-29 05:33:37,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:33:37,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:37,509 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] [2023-11-29 05:33:37,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:33:37,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:37,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash -573177674, now seen corresponding path program 1 times [2023-11-29 05:33:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125606547] [2023-11-29 05:33:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:37,564 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-29 05:33:37,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125606547] [2023-11-29 05:33:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125606547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:37,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:37,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019572280] [2023-11-29 05:33:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:37,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:37,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:37,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:37,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 644 out of 676 [2023-11-29 05:33:37,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 625 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:37,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:37,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 644 of 676 [2023-11-29 05:33:37,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:37,878 INFO L124 PetriNetUnfolderBase]: 51/1152 cut-off events. [2023-11-29 05:33:37,878 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 05:33:37,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1152 events. 51/1152 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5907 event pairs, 12 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1151. Up to 39 conditions per place. [2023-11-29 05:33:37,894 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 14 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2023-11-29 05:33:37,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 624 transitions, 1290 flow [2023-11-29 05:33:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1949 transitions. [2023-11-29 05:33:37,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610453648915187 [2023-11-29 05:33:37,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1949 transitions. [2023-11-29 05:33:37,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1949 transitions. [2023-11-29 05:33:37,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:37,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1949 transitions. [2023-11-29 05:33:37,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:33:37,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:37,913 INFO L175 Difference]: Start difference. First operand has 612 places, 625 transitions, 1260 flow. Second operand 3 states and 1949 transitions. [2023-11-29 05:33:37,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 624 transitions, 1290 flow [2023-11-29 05:33:37,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 624 transitions, 1286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:37,922 INFO L231 Difference]: Finished difference. Result has 611 places, 624 transitions, 1258 flow [2023-11-29 05:33:37,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1258, PETRI_PLACES=611, PETRI_TRANSITIONS=624} [2023-11-29 05:33:37,924 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -14 predicate places. [2023-11-29 05:33:37,924 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 624 transitions, 1258 flow [2023-11-29 05:33:37,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:37,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:37,926 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] [2023-11-29 05:33:37,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:33:37,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:37,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash 795348866, now seen corresponding path program 1 times [2023-11-29 05:33:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721085278] [2023-11-29 05:33:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:37,975 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-29 05:33:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721085278] [2023-11-29 05:33:37,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721085278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:37,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:37,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:37,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570384290] [2023-11-29 05:33:37,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:37,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:37,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:37,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:37,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:38,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 644 out of 676 [2023-11-29 05:33:38,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 624 transitions, 1258 flow. Second operand has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:38,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:38,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 644 of 676 [2023-11-29 05:33:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:38,455 INFO L124 PetriNetUnfolderBase]: 89/1873 cut-off events. [2023-11-29 05:33:38,455 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 05:33:38,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 1873 events. 89/1873 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12615 event pairs, 20 based on Foata normal form. 0/1522 useless extension candidates. Maximal degree in co-relation 1882. Up to 51 conditions per place. [2023-11-29 05:33:38,489 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 14 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2023-11-29 05:33:38,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 623 transitions, 1288 flow [2023-11-29 05:33:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1949 transitions. [2023-11-29 05:33:38,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610453648915187 [2023-11-29 05:33:38,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:38,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:33:38,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:38,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:38,511 INFO L175 Difference]: Start difference. First operand has 611 places, 624 transitions, 1258 flow. Second operand 3 states and 1949 transitions. [2023-11-29 05:33:38,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 623 transitions, 1288 flow [2023-11-29 05:33:38,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 623 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:38,524 INFO L231 Difference]: Finished difference. Result has 610 places, 623 transitions, 1256 flow [2023-11-29 05:33:38,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=610, PETRI_TRANSITIONS=623} [2023-11-29 05:33:38,526 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -15 predicate places. [2023-11-29 05:33:38,526 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 623 transitions, 1256 flow [2023-11-29 05:33:38,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:38,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:38,528 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] [2023-11-29 05:33:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:33:38,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:38,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 841972817, now seen corresponding path program 1 times [2023-11-29 05:33:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798028901] [2023-11-29 05:33:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:38,575 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-29 05:33:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798028901] [2023-11-29 05:33:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798028901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125872655] [2023-11-29 05:33:38,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:38,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:38,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 644 out of 676 [2023-11-29 05:33:38,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 623 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:38,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:38,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 644 of 676 [2023-11-29 05:33:38,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:38,871 INFO L124 PetriNetUnfolderBase]: 49/976 cut-off events. [2023-11-29 05:33:38,872 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 05:33:38,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 976 events. 49/976 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4565 event pairs, 20 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 969. Up to 51 conditions per place. [2023-11-29 05:33:38,891 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 14 selfloop transitions, 2 changer transitions 0/622 dead transitions. [2023-11-29 05:33:38,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 622 transitions, 1286 flow [2023-11-29 05:33:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1949 transitions. [2023-11-29 05:33:38,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610453648915187 [2023-11-29 05:33:38,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:38,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1949 transitions. [2023-11-29 05:33:38,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:33:38,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:38,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:38,913 INFO L175 Difference]: Start difference. First operand has 610 places, 623 transitions, 1256 flow. Second operand 3 states and 1949 transitions. [2023-11-29 05:33:38,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 622 transitions, 1286 flow [2023-11-29 05:33:38,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 622 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:38,926 INFO L231 Difference]: Finished difference. Result has 609 places, 622 transitions, 1254 flow [2023-11-29 05:33:38,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1254, PETRI_PLACES=609, PETRI_TRANSITIONS=622} [2023-11-29 05:33:38,928 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -16 predicate places. [2023-11-29 05:33:38,929 INFO L495 AbstractCegarLoop]: Abstraction has has 609 places, 622 transitions, 1254 flow [2023-11-29 05:33:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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-29 05:33:38,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:38,930 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] [2023-11-29 05:33:38,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:33:38,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:38,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1545376931, now seen corresponding path program 1 times [2023-11-29 05:33:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501759465] [2023-11-29 05:33:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:38,978 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-29 05:33:38,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501759465] [2023-11-29 05:33:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501759465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:33:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567868975] [2023-11-29 05:33:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:38,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:33:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:33:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:33:39,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 676 [2023-11-29 05:33:39,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 622 transitions, 1254 flow. Second operand has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:33:39,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:39,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 676 [2023-11-29 05:33:39,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:33:39,344 INFO L124 PetriNetUnfolderBase]: 96/1604 cut-off events. [2023-11-29 05:33:39,344 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 05:33:39,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1604 events. 96/1604 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9562 event pairs, 32 based on Foata normal form. 0/1332 useless extension candidates. Maximal degree in co-relation 1635. Up to 91 conditions per place. [2023-11-29 05:33:39,368 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 16 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2023-11-29 05:33:39,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 617 transitions, 1278 flow [2023-11-29 05:33:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:33:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:33:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1942 transitions. [2023-11-29 05:33:39,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9575936883629191 [2023-11-29 05:33:39,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1942 transitions. [2023-11-29 05:33:39,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1942 transitions. [2023-11-29 05:33:39,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:33:39,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1942 transitions. [2023-11-29 05:33:39,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 647.3333333333334) internal successors, (1942), 3 states have internal predecessors, (1942), 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-29 05:33:39,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:39,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:33:39,383 INFO L175 Difference]: Start difference. First operand has 609 places, 622 transitions, 1254 flow. Second operand 3 states and 1942 transitions. [2023-11-29 05:33:39,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 617 transitions, 1278 flow [2023-11-29 05:33:39,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 617 transitions, 1274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:33:39,391 INFO L231 Difference]: Finished difference. Result has 604 places, 617 transitions, 1242 flow [2023-11-29 05:33:39,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=604, PETRI_TRANSITIONS=617} [2023-11-29 05:33:39,393 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -21 predicate places. [2023-11-29 05:33:39,393 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 617 transitions, 1242 flow [2023-11-29 05:33:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:33:39,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:33:39,395 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] [2023-11-29 05:33:39,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:33:39,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:33:39,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -431287402, now seen corresponding path program 1 times [2023-11-29 05:33:39,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:39,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50620866] [2023-11-29 05:33:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:39,960 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-29 05:33:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50620866] [2023-11-29 05:33:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50620866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:33:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706036899] [2023-11-29 05:33:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:39,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:33:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:39,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:33:39,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:33:40,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 554 out of 676 [2023-11-29 05:33:40,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 617 transitions, 1242 flow. Second operand has 6 states, 6 states have (on average 555.5) internal successors, (3333), 6 states have internal predecessors, (3333), 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-29 05:33:40,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:33:40,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 554 of 676 [2023-11-29 05:33:40,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:25,252 INFO L124 PetriNetUnfolderBase]: 78708/250296 cut-off events. [2023-11-29 05:34:25,252 INFO L125 PetriNetUnfolderBase]: For 909/1075 co-relation queries the response was YES. [2023-11-29 05:34:26,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349996 conditions, 250296 events. 78708/250296 cut-off events. For 909/1075 co-relation queries the response was YES. Maximal size of possible extension queue 4899. Compared 3880781 event pairs, 67808 based on Foata normal form. 0/212333 useless extension candidates. Maximal degree in co-relation 349920. Up to 99375 conditions per place. [2023-11-29 05:34:27,850 INFO L140 encePairwiseOnDemand]: 658/676 looper letters, 90 selfloop transitions, 15 changer transitions 0/614 dead transitions. [2023-11-29 05:34:27,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 614 transitions, 1446 flow [2023-11-29 05:34:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:34:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:34:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3432 transitions. [2023-11-29 05:34:27,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2023-11-29 05:34:27,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3432 transitions. [2023-11-29 05:34:27,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3432 transitions. [2023-11-29 05:34:27,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:27,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3432 transitions. [2023-11-29 05:34:27,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 572.0) internal successors, (3432), 6 states have internal predecessors, (3432), 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-29 05:34:27,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:27,878 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:27,878 INFO L175 Difference]: Start difference. First operand has 604 places, 617 transitions, 1242 flow. Second operand 6 states and 3432 transitions. [2023-11-29 05:34:27,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 614 transitions, 1446 flow [2023-11-29 05:34:27,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 614 transitions, 1445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:34:27,888 INFO L231 Difference]: Finished difference. Result has 605 places, 614 transitions, 1265 flow [2023-11-29 05:34:27,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1265, PETRI_PLACES=605, PETRI_TRANSITIONS=614} [2023-11-29 05:34:27,890 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -20 predicate places. [2023-11-29 05:34:27,890 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 614 transitions, 1265 flow [2023-11-29 05:34:27,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 555.5) internal successors, (3333), 6 states have internal predecessors, (3333), 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-29 05:34:27,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:27,892 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] [2023-11-29 05:34:27,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:34:27,892 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:27,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -754409392, now seen corresponding path program 1 times [2023-11-29 05:34:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:27,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29723660] [2023-11-29 05:34:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:27,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:27,931 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-29 05:34:27,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:27,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29723660] [2023-11-29 05:34:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29723660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:27,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343218665] [2023-11-29 05:34:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:27,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:27,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:34:27,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 614 transitions, 1265 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:27,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:27,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:34:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:28,188 INFO L124 PetriNetUnfolderBase]: 51/1137 cut-off events. [2023-11-29 05:34:28,188 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 05:34:28,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 1137 events. 51/1137 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5625 event pairs, 12 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1154. Up to 38 conditions per place. [2023-11-29 05:34:28,206 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/613 dead transitions. [2023-11-29 05:34:28,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 613 transitions, 1293 flow [2023-11-29 05:34:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1951 transitions. [2023-11-29 05:34:28,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9620315581854043 [2023-11-29 05:34:28,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1951 transitions. [2023-11-29 05:34:28,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1951 transitions. [2023-11-29 05:34:28,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:28,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1951 transitions. [2023-11-29 05:34:28,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:34:28,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:28,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:28,226 INFO L175 Difference]: Start difference. First operand has 605 places, 614 transitions, 1265 flow. Second operand 3 states and 1951 transitions. [2023-11-29 05:34:28,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 613 transitions, 1293 flow [2023-11-29 05:34:28,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 613 transitions, 1263 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:34:28,239 INFO L231 Difference]: Finished difference. Result has 601 places, 613 transitions, 1237 flow [2023-11-29 05:34:28,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1237, PETRI_PLACES=601, PETRI_TRANSITIONS=613} [2023-11-29 05:34:28,241 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -24 predicate places. [2023-11-29 05:34:28,241 INFO L495 AbstractCegarLoop]: Abstraction has has 601 places, 613 transitions, 1237 flow [2023-11-29 05:34:28,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:28,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:28,243 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] [2023-11-29 05:34:28,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:34:28,243 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:28,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash -464664726, now seen corresponding path program 1 times [2023-11-29 05:34:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872674299] [2023-11-29 05:34:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:28,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,286 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-29 05:34:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872674299] [2023-11-29 05:34:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872674299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058127801] [2023-11-29 05:34:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:28,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:28,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 676 [2023-11-29 05:34:28,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 613 transitions, 1237 flow. Second operand has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:34:28,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:28,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 676 [2023-11-29 05:34:28,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:28,797 INFO L124 PetriNetUnfolderBase]: 183/2456 cut-off events. [2023-11-29 05:34:28,797 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2023-11-29 05:34:28,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 2456 events. 183/2456 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 19426 event pairs, 64 based on Foata normal form. 0/2032 useless extension candidates. Maximal degree in co-relation 2580. Up to 163 conditions per place. [2023-11-29 05:34:28,839 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 16 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2023-11-29 05:34:28,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1261 flow [2023-11-29 05:34:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1942 transitions. [2023-11-29 05:34:28,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9575936883629191 [2023-11-29 05:34:28,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1942 transitions. [2023-11-29 05:34:28,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1942 transitions. [2023-11-29 05:34:28,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:28,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1942 transitions. [2023-11-29 05:34:28,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 647.3333333333334) internal successors, (1942), 3 states have internal predecessors, (1942), 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-29 05:34:28,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:28,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:28,857 INFO L175 Difference]: Start difference. First operand has 601 places, 613 transitions, 1237 flow. Second operand 3 states and 1942 transitions. [2023-11-29 05:34:28,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1261 flow [2023-11-29 05:34:28,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:28,870 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1225 flow [2023-11-29 05:34:28,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1225, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2023-11-29 05:34:28,872 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -29 predicate places. [2023-11-29 05:34:28,872 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1225 flow [2023-11-29 05:34:28,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:34:28,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:28,874 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] [2023-11-29 05:34:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:34:28,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:28,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash 288148390, now seen corresponding path program 1 times [2023-11-29 05:34:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:28,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519338235] [2023-11-29 05:34:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,930 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-29 05:34:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519338235] [2023-11-29 05:34:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519338235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:28,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:28,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110800191] [2023-11-29 05:34:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:28,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:28,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:28,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:28,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:34:28,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1225 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:28,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:28,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:34:28,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:29,388 INFO L124 PetriNetUnfolderBase]: 89/1837 cut-off events. [2023-11-29 05:34:29,388 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 05:34:29,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1837 events. 89/1837 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10979 event pairs, 20 based on Foata normal form. 0/1521 useless extension candidates. Maximal degree in co-relation 1829. Up to 50 conditions per place. [2023-11-29 05:34:29,416 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2023-11-29 05:34:29,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1253 flow [2023-11-29 05:34:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1951 transitions. [2023-11-29 05:34:29,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9620315581854043 [2023-11-29 05:34:29,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1951 transitions. [2023-11-29 05:34:29,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1951 transitions. [2023-11-29 05:34:29,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:29,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1951 transitions. [2023-11-29 05:34:29,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:34:29,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:29,434 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:29,434 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1225 flow. Second operand 3 states and 1951 transitions. [2023-11-29 05:34:29,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1253 flow [2023-11-29 05:34:29,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:34:29,447 INFO L231 Difference]: Finished difference. Result has 596 places, 607 transitions, 1226 flow [2023-11-29 05:34:29,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=607} [2023-11-29 05:34:29,448 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -29 predicate places. [2023-11-29 05:34:29,448 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 607 transitions, 1226 flow [2023-11-29 05:34:29,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:29,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:29,449 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-29 05:34:29,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:34:29,450 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:29,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -750171759, now seen corresponding path program 1 times [2023-11-29 05:34:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608343656] [2023-11-29 05:34:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:29,503 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-29 05:34:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:29,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608343656] [2023-11-29 05:34:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608343656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217593531] [2023-11-29 05:34:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:29,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 676 [2023-11-29 05:34:29,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 607 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:34:29,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:29,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 676 [2023-11-29 05:34:29,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:30,042 INFO L124 PetriNetUnfolderBase]: 175/2070 cut-off events. [2023-11-29 05:34:30,042 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-29 05:34:30,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 2070 events. 175/2070 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 14251 event pairs, 64 based on Foata normal form. 0/1754 useless extension candidates. Maximal degree in co-relation 2182. Up to 174 conditions per place. [2023-11-29 05:34:30,070 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 16 selfloop transitions, 1 changer transitions 0/602 dead transitions. [2023-11-29 05:34:30,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 602 transitions, 1250 flow [2023-11-29 05:34:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1942 transitions. [2023-11-29 05:34:30,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9575936883629191 [2023-11-29 05:34:30,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1942 transitions. [2023-11-29 05:34:30,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1942 transitions. [2023-11-29 05:34:30,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:30,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1942 transitions. [2023-11-29 05:34:30,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 647.3333333333334) internal successors, (1942), 3 states have internal predecessors, (1942), 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-29 05:34:30,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,083 INFO L175 Difference]: Start difference. First operand has 596 places, 607 transitions, 1226 flow. Second operand 3 states and 1942 transitions. [2023-11-29 05:34:30,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 602 transitions, 1250 flow [2023-11-29 05:34:30,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 602 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:30,091 INFO L231 Difference]: Finished difference. Result has 591 places, 602 transitions, 1214 flow [2023-11-29 05:34:30,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=591, PETRI_TRANSITIONS=602} [2023-11-29 05:34:30,093 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -34 predicate places. [2023-11-29 05:34:30,093 INFO L495 AbstractCegarLoop]: Abstraction has has 591 places, 602 transitions, 1214 flow [2023-11-29 05:34:30,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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-29 05:34:30,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:30,094 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] [2023-11-29 05:34:30,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:34:30,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:30,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145114, now seen corresponding path program 1 times [2023-11-29 05:34:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:30,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734164823] [2023-11-29 05:34:30,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,142 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-29 05:34:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734164823] [2023-11-29 05:34:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734164823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631476848] [2023-11-29 05:34:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:30,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:30,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 676 [2023-11-29 05:34:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 602 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 676 [2023-11-29 05:34:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:30,341 INFO L124 PetriNetUnfolderBase]: 49/947 cut-off events. [2023-11-29 05:34:30,341 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 05:34:30,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 947 events. 49/947 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3943 event pairs, 20 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 932. Up to 50 conditions per place. [2023-11-29 05:34:30,355 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2023-11-29 05:34:30,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 601 transitions, 1242 flow [2023-11-29 05:34:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1951 transitions. [2023-11-29 05:34:30,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9620315581854043 [2023-11-29 05:34:30,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1951 transitions. [2023-11-29 05:34:30,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1951 transitions. [2023-11-29 05:34:30,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:30,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1951 transitions. [2023-11-29 05:34:30,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:34:30,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,368 INFO L175 Difference]: Start difference. First operand has 591 places, 602 transitions, 1214 flow. Second operand 3 states and 1951 transitions. [2023-11-29 05:34:30,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 601 transitions, 1242 flow [2023-11-29 05:34:30,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 601 transitions, 1241 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:34:30,377 INFO L231 Difference]: Finished difference. Result has 591 places, 601 transitions, 1215 flow [2023-11-29 05:34:30,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=591, PETRI_TRANSITIONS=601} [2023-11-29 05:34:30,378 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -34 predicate places. [2023-11-29 05:34:30,379 INFO L495 AbstractCegarLoop]: Abstraction has has 591 places, 601 transitions, 1215 flow [2023-11-29 05:34:30,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.3333333333334) internal successors, (1939), 3 states have internal predecessors, (1939), 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-29 05:34:30,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:30,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] [2023-11-29 05:34:30,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:34:30,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:30,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash -771965930, now seen corresponding path program 1 times [2023-11-29 05:34:30,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:30,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063272668] [2023-11-29 05:34:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:30,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,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-29 05:34:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063272668] [2023-11-29 05:34:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063272668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730378541] [2023-11-29 05:34:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:30,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:30,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:34:30,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 601 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:30,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:30,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:34:30,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:30,784 INFO L124 PetriNetUnfolderBase]: 96/1577 cut-off events. [2023-11-29 05:34:30,784 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 05:34:30,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 1577 events. 96/1577 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9420 event pairs, 20 based on Foata normal form. 0/1339 useless extension candidates. Maximal degree in co-relation 1598. Up to 75 conditions per place. [2023-11-29 05:34:30,799 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 17 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2023-11-29 05:34:30,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 601 transitions, 1255 flow [2023-11-29 05:34:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1952 transitions. [2023-11-29 05:34:30,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625246548323472 [2023-11-29 05:34:30,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1952 transitions. [2023-11-29 05:34:30,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1952 transitions. [2023-11-29 05:34:30,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:30,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1952 transitions. [2023-11-29 05:34:30,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.6666666666666) internal successors, (1952), 3 states have internal predecessors, (1952), 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-29 05:34:30,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:30,813 INFO L175 Difference]: Start difference. First operand has 591 places, 601 transitions, 1215 flow. Second operand 3 states and 1952 transitions. [2023-11-29 05:34:30,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 601 transitions, 1255 flow [2023-11-29 05:34:30,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 601 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:30,824 INFO L231 Difference]: Finished difference. Result has 588 places, 599 transitions, 1217 flow [2023-11-29 05:34:30,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1217, PETRI_PLACES=588, PETRI_TRANSITIONS=599} [2023-11-29 05:34:30,825 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -37 predicate places. [2023-11-29 05:34:30,826 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 599 transitions, 1217 flow [2023-11-29 05:34:30,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:30,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:30,826 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] [2023-11-29 05:34:30,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:34:30,826 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:30,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1170132184, now seen corresponding path program 1 times [2023-11-29 05:34:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120241240] [2023-11-29 05:34:30,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,880 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-29 05:34:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120241240] [2023-11-29 05:34:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120241240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383459527] [2023-11-29 05:34:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:30,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:30,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:34:30,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 599 transitions, 1217 flow. Second operand has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:30,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:30,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:34:30,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:31,275 INFO L124 PetriNetUnfolderBase]: 160/2347 cut-off events. [2023-11-29 05:34:31,275 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2023-11-29 05:34:31,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 2347 events. 160/2347 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18316 event pairs, 53 based on Foata normal form. 0/1991 useless extension candidates. Maximal degree in co-relation 2447. Up to 123 conditions per place. [2023-11-29 05:34:31,299 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 17 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2023-11-29 05:34:31,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 599 transitions, 1257 flow [2023-11-29 05:34:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1952 transitions. [2023-11-29 05:34:31,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625246548323472 [2023-11-29 05:34:31,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:31,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.6666666666666) internal successors, (1952), 3 states have internal predecessors, (1952), 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-29 05:34:31,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:31,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:31,315 INFO L175 Difference]: Start difference. First operand has 588 places, 599 transitions, 1217 flow. Second operand 3 states and 1952 transitions. [2023-11-29 05:34:31,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 599 transitions, 1257 flow [2023-11-29 05:34:31,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1257 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:31,329 INFO L231 Difference]: Finished difference. Result has 587 places, 597 transitions, 1223 flow [2023-11-29 05:34:31,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=587, PETRI_TRANSITIONS=597} [2023-11-29 05:34:31,330 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -38 predicate places. [2023-11-29 05:34:31,331 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 597 transitions, 1223 flow [2023-11-29 05:34:31,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:31,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:31,332 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] [2023-11-29 05:34:31,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:34:31,332 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:31,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -619055629, now seen corresponding path program 1 times [2023-11-29 05:34:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860078149] [2023-11-29 05:34:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,395 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-29 05:34:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860078149] [2023-11-29 05:34:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860078149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:31,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:31,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955995235] [2023-11-29 05:34:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:31,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:31,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:34:31,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 597 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:34:31,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:31,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:34:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:31,903 INFO L124 PetriNetUnfolderBase]: 224/2874 cut-off events. [2023-11-29 05:34:31,903 INFO L125 PetriNetUnfolderBase]: For 31/33 co-relation queries the response was YES. [2023-11-29 05:34:31,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 2874 events. 224/2874 cut-off events. For 31/33 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23501 event pairs, 80 based on Foata normal form. 0/2462 useless extension candidates. Maximal degree in co-relation 3048. Up to 202 conditions per place. [2023-11-29 05:34:31,931 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 17 selfloop transitions, 2 changer transitions 0/597 dead transitions. [2023-11-29 05:34:31,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 597 transitions, 1263 flow [2023-11-29 05:34:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1952 transitions. [2023-11-29 05:34:31,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625246548323472 [2023-11-29 05:34:31,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:31,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1952 transitions. [2023-11-29 05:34:31,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 650.6666666666666) internal successors, (1952), 3 states have internal predecessors, (1952), 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-29 05:34:31,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:31,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:31,941 INFO L175 Difference]: Start difference. First operand has 587 places, 597 transitions, 1223 flow. Second operand 3 states and 1952 transitions. [2023-11-29 05:34:31,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 597 transitions, 1263 flow [2023-11-29 05:34:31,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 597 transitions, 1263 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:31,949 INFO L231 Difference]: Finished difference. Result has 586 places, 595 transitions, 1229 flow [2023-11-29 05:34:31,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1229, PETRI_PLACES=586, PETRI_TRANSITIONS=595} [2023-11-29 05:34:31,950 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -39 predicate places. [2023-11-29 05:34:31,950 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 595 transitions, 1229 flow [2023-11-29 05:34:31,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:34:31,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:31,951 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-29 05:34:31,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:34:31,951 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:31,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash -224934380, now seen corresponding path program 1 times [2023-11-29 05:34:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:31,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125926229] [2023-11-29 05:34:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:32,001 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-29 05:34:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125926229] [2023-11-29 05:34:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125926229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:32,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:32,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429238132] [2023-11-29 05:34:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:32,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:32,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:32,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 595 transitions, 1229 flow. Second operand has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:34:32,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:32,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:32,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:32,371 INFO L124 PetriNetUnfolderBase]: 109/2094 cut-off events. [2023-11-29 05:34:32,371 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2023-11-29 05:34:32,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 2094 events. 109/2094 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13843 event pairs, 8 based on Foata normal form. 1/1803 useless extension candidates. Maximal degree in co-relation 2126. Up to 33 conditions per place. [2023-11-29 05:34:32,392 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/596 dead transitions. [2023-11-29 05:34:32,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 596 transitions, 1263 flow [2023-11-29 05:34:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:32,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:32,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:32,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:32,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:32,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:32,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:32,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:32,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:32,403 INFO L175 Difference]: Start difference. First operand has 586 places, 595 transitions, 1229 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:32,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 596 transitions, 1263 flow [2023-11-29 05:34:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 596 transitions, 1263 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:32,411 INFO L231 Difference]: Finished difference. Result has 587 places, 594 transitions, 1231 flow [2023-11-29 05:34:32,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=587, PETRI_TRANSITIONS=594} [2023-11-29 05:34:32,412 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -38 predicate places. [2023-11-29 05:34:32,413 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 594 transitions, 1231 flow [2023-11-29 05:34:32,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:34:32,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:32,413 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, 1] [2023-11-29 05:34:32,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:34:32,413 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:32,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -810398640, now seen corresponding path program 1 times [2023-11-29 05:34:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740437591] [2023-11-29 05:34:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:32,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:32,463 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-29 05:34:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:32,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740437591] [2023-11-29 05:34:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740437591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:32,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:34:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742559275] [2023-11-29 05:34:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:32,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:32,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:32,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:32,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 594 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:32,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:32,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:32,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:32,759 INFO L124 PetriNetUnfolderBase]: 90/1612 cut-off events. [2023-11-29 05:34:32,759 INFO L125 PetriNetUnfolderBase]: For 4/11 co-relation queries the response was YES. [2023-11-29 05:34:32,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1612 events. 90/1612 cut-off events. For 4/11 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10458 event pairs, 12 based on Foata normal form. 1/1393 useless extension candidates. Maximal degree in co-relation 1678. Up to 40 conditions per place. [2023-11-29 05:34:32,776 INFO L140 encePairwiseOnDemand]: 672/676 looper letters, 14 selfloop transitions, 3 changer transitions 0/597 dead transitions. [2023-11-29 05:34:32,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 597 transitions, 1273 flow [2023-11-29 05:34:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2023-11-29 05:34:32,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9674556213017751 [2023-11-29 05:34:32,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1962 transitions. [2023-11-29 05:34:32,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1962 transitions. [2023-11-29 05:34:32,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:32,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1962 transitions. [2023-11-29 05:34:32,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.0) internal successors, (1962), 3 states have internal predecessors, (1962), 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-29 05:34:32,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:32,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:32,788 INFO L175 Difference]: Start difference. First operand has 587 places, 594 transitions, 1231 flow. Second operand 3 states and 1962 transitions. [2023-11-29 05:34:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 597 transitions, 1273 flow [2023-11-29 05:34:32,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 597 transitions, 1269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:32,799 INFO L231 Difference]: Finished difference. Result has 589 places, 595 transitions, 1245 flow [2023-11-29 05:34:32,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1245, PETRI_PLACES=589, PETRI_TRANSITIONS=595} [2023-11-29 05:34:32,800 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -36 predicate places. [2023-11-29 05:34:32,800 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 595 transitions, 1245 flow [2023-11-29 05:34:32,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:32,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:32,801 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, 1, 1, 1, 1] [2023-11-29 05:34:32,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:34:32,801 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:32,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 145324955, now seen corresponding path program 1 times [2023-11-29 05:34:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896689314] [2023-11-29 05:34:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:32,866 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-29 05:34:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896689314] [2023-11-29 05:34:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896689314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:32,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204149896] [2023-11-29 05:34:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:32,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:34:32,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 595 transitions, 1245 flow. Second operand has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:32,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:32,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:34:32,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:33,440 INFO L124 PetriNetUnfolderBase]: 198/2709 cut-off events. [2023-11-29 05:34:33,440 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:34:33,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 2709 events. 198/2709 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 20313 event pairs, 24 based on Foata normal form. 0/2347 useless extension candidates. Maximal degree in co-relation 2907. Up to 176 conditions per place. [2023-11-29 05:34:33,474 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 20 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2023-11-29 05:34:33,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1300 flow [2023-11-29 05:34:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1955 transitions. [2023-11-29 05:34:33,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640039447731755 [2023-11-29 05:34:33,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1955 transitions. [2023-11-29 05:34:33,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1955 transitions. [2023-11-29 05:34:33,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:33,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1955 transitions. [2023-11-29 05:34:33,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 651.6666666666666) internal successors, (1955), 3 states have internal predecessors, (1955), 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-29 05:34:33,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:33,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:33,486 INFO L175 Difference]: Start difference. First operand has 589 places, 595 transitions, 1245 flow. Second operand 3 states and 1955 transitions. [2023-11-29 05:34:33,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1300 flow [2023-11-29 05:34:33,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:33,499 INFO L231 Difference]: Finished difference. Result has 586 places, 593 transitions, 1245 flow [2023-11-29 05:34:33,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1245, PETRI_PLACES=586, PETRI_TRANSITIONS=593} [2023-11-29 05:34:33,500 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -39 predicate places. [2023-11-29 05:34:33,500 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 593 transitions, 1245 flow [2023-11-29 05:34:33,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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-29 05:34:33,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:33,501 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, 1, 1, 1, 1, 1] [2023-11-29 05:34:33,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:34:33,501 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:33,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1575466930, now seen corresponding path program 1 times [2023-11-29 05:34:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121038133] [2023-11-29 05:34:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,182 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-29 05:34:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121038133] [2023-11-29 05:34:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121038133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:34:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606782536] [2023-11-29 05:34:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:34:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:34:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:34:34,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 676 [2023-11-29 05:34:34,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 593 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 635.6666666666666) internal successors, (3814), 6 states have internal predecessors, (3814), 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-29 05:34:34,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:34,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 676 [2023-11-29 05:34:34,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:35,220 INFO L124 PetriNetUnfolderBase]: 76/1462 cut-off events. [2023-11-29 05:34:35,221 INFO L125 PetriNetUnfolderBase]: For 7/14 co-relation queries the response was YES. [2023-11-29 05:34:35,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1462 events. 76/1462 cut-off events. For 7/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8456 event pairs, 0 based on Foata normal form. 4/1287 useless extension candidates. Maximal degree in co-relation 1485. Up to 29 conditions per place. [2023-11-29 05:34:35,239 INFO L140 encePairwiseOnDemand]: 671/676 looper letters, 21 selfloop transitions, 4 changer transitions 0/592 dead transitions. [2023-11-29 05:34:35,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 592 transitions, 1293 flow [2023-11-29 05:34:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:34:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:34:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3830 transitions. [2023-11-29 05:34:35,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9442800788954635 [2023-11-29 05:34:35,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3830 transitions. [2023-11-29 05:34:35,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3830 transitions. [2023-11-29 05:34:35,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:35,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3830 transitions. [2023-11-29 05:34:35,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 638.3333333333334) internal successors, (3830), 6 states have internal predecessors, (3830), 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-29 05:34:35,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:35,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:35,262 INFO L175 Difference]: Start difference. First operand has 586 places, 593 transitions, 1245 flow. Second operand 6 states and 3830 transitions. [2023-11-29 05:34:35,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 592 transitions, 1293 flow [2023-11-29 05:34:35,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 592 transitions, 1293 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:35,274 INFO L231 Difference]: Finished difference. Result has 590 places, 592 transitions, 1251 flow [2023-11-29 05:34:35,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1251, PETRI_PLACES=590, PETRI_TRANSITIONS=592} [2023-11-29 05:34:35,276 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -35 predicate places. [2023-11-29 05:34:35,276 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 592 transitions, 1251 flow [2023-11-29 05:34:35,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 635.6666666666666) internal successors, (3814), 6 states have internal predecessors, (3814), 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-29 05:34:35,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:35,277 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:35,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:34:35,277 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:35,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:35,277 INFO L85 PathProgramCache]: Analyzing trace with hash 670348106, now seen corresponding path program 1 times [2023-11-29 05:34:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751361676] [2023-11-29 05:34:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:35,326 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-29 05:34:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751361676] [2023-11-29 05:34:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751361676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:35,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:35,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291336940] [2023-11-29 05:34:35,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:35,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:35,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:35,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:35,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:35,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 592 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:35,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:35,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:35,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:35,908 INFO L124 PetriNetUnfolderBase]: 184/3037 cut-off events. [2023-11-29 05:34:35,908 INFO L125 PetriNetUnfolderBase]: For 20/67 co-relation queries the response was YES. [2023-11-29 05:34:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 3037 events. 184/3037 cut-off events. For 20/67 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 23731 event pairs, 16 based on Foata normal form. 3/2646 useless extension candidates. Maximal degree in co-relation 3208. Up to 80 conditions per place. [2023-11-29 05:34:35,944 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/593 dead transitions. [2023-11-29 05:34:35,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 593 transitions, 1285 flow [2023-11-29 05:34:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:35,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:35,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:35,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:35,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:35,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:35,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:35,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:35,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:35,954 INFO L175 Difference]: Start difference. First operand has 590 places, 592 transitions, 1251 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:35,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 593 transitions, 1285 flow [2023-11-29 05:34:35,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 593 transitions, 1278 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:34:35,963 INFO L231 Difference]: Finished difference. Result has 587 places, 591 transitions, 1246 flow [2023-11-29 05:34:35,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=587, PETRI_TRANSITIONS=591} [2023-11-29 05:34:35,964 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -38 predicate places. [2023-11-29 05:34:35,964 INFO L495 AbstractCegarLoop]: Abstraction has has 587 places, 591 transitions, 1246 flow [2023-11-29 05:34:35,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:35,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:35,964 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:35,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:34:35,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:35,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1173554763, now seen corresponding path program 1 times [2023-11-29 05:34:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133724565] [2023-11-29 05:34:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,028 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-29 05:34:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133724565] [2023-11-29 05:34:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133724565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:34:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940955681] [2023-11-29 05:34:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:36,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:36,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:36,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:36,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 591 transitions, 1246 flow. Second operand has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:36,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:36,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:36,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:36,619 INFO L124 PetriNetUnfolderBase]: 154/2351 cut-off events. [2023-11-29 05:34:36,619 INFO L125 PetriNetUnfolderBase]: For 26/69 co-relation queries the response was YES. [2023-11-29 05:34:36,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 2351 events. 154/2351 cut-off events. For 26/69 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 17900 event pairs, 24 based on Foata normal form. 2/2037 useless extension candidates. Maximal degree in co-relation 2494. Up to 78 conditions per place. [2023-11-29 05:34:36,659 INFO L140 encePairwiseOnDemand]: 672/676 looper letters, 14 selfloop transitions, 3 changer transitions 0/594 dead transitions. [2023-11-29 05:34:36,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 594 transitions, 1288 flow [2023-11-29 05:34:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2023-11-29 05:34:36,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9674556213017751 [2023-11-29 05:34:36,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1962 transitions. [2023-11-29 05:34:36,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1962 transitions. [2023-11-29 05:34:36,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:36,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1962 transitions. [2023-11-29 05:34:36,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.0) internal successors, (1962), 3 states have internal predecessors, (1962), 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-29 05:34:36,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:36,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:36,672 INFO L175 Difference]: Start difference. First operand has 587 places, 591 transitions, 1246 flow. Second operand 3 states and 1962 transitions. [2023-11-29 05:34:36,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 594 transitions, 1288 flow [2023-11-29 05:34:36,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 594 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:36,684 INFO L231 Difference]: Finished difference. Result has 589 places, 592 transitions, 1260 flow [2023-11-29 05:34:36,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=589, PETRI_TRANSITIONS=592} [2023-11-29 05:34:36,686 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -36 predicate places. [2023-11-29 05:34:36,686 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 592 transitions, 1260 flow [2023-11-29 05:34:36,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:36,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:36,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:36,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:34:36,687 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:36,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1113033789, now seen corresponding path program 1 times [2023-11-29 05:34:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549042417] [2023-11-29 05:34:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,751 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-29 05:34:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549042417] [2023-11-29 05:34:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549042417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256413128] [2023-11-29 05:34:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:36,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:36,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:36,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 592 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:34:36,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:36,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:36,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:37,384 INFO L124 PetriNetUnfolderBase]: 162/2726 cut-off events. [2023-11-29 05:34:37,384 INFO L125 PetriNetUnfolderBase]: For 22/32 co-relation queries the response was YES. [2023-11-29 05:34:37,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 2726 events. 162/2726 cut-off events. For 22/32 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20405 event pairs, 10 based on Foata normal form. 2/2390 useless extension candidates. Maximal degree in co-relation 2901. Up to 57 conditions per place. [2023-11-29 05:34:37,414 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/593 dead transitions. [2023-11-29 05:34:37,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 593 transitions, 1294 flow [2023-11-29 05:34:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:37,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:37,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:37,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:37,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:37,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:37,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:37,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:37,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:37,424 INFO L175 Difference]: Start difference. First operand has 589 places, 592 transitions, 1260 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:37,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 593 transitions, 1294 flow [2023-11-29 05:34:37,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 593 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:37,432 INFO L231 Difference]: Finished difference. Result has 588 places, 591 transitions, 1256 flow [2023-11-29 05:34:37,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1256, PETRI_PLACES=588, PETRI_TRANSITIONS=591} [2023-11-29 05:34:37,433 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -37 predicate places. [2023-11-29 05:34:37,434 INFO L495 AbstractCegarLoop]: Abstraction has has 588 places, 591 transitions, 1256 flow [2023-11-29 05:34:37,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:34:37,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:37,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:37,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:34:37,434 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:37,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1643171679, now seen corresponding path program 1 times [2023-11-29 05:34:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213686784] [2023-11-29 05:34:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:37,647 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-29 05:34:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213686784] [2023-11-29 05:34:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213686784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:37,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:37,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314492916] [2023-11-29 05:34:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:38,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:34:38,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 591 transitions, 1256 flow. Second operand has 8 states, 8 states have (on average 620.125) internal successors, (4961), 8 states have internal predecessors, (4961), 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-29 05:34:38,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:38,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:34:38,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:39,074 INFO L124 PetriNetUnfolderBase]: 253/3953 cut-off events. [2023-11-29 05:34:39,074 INFO L125 PetriNetUnfolderBase]: For 18/27 co-relation queries the response was YES. [2023-11-29 05:34:39,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4475 conditions, 3953 events. 253/3953 cut-off events. For 18/27 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 34427 event pairs, 34 based on Foata normal form. 5/3479 useless extension candidates. Maximal degree in co-relation 4421. Up to 120 conditions per place. [2023-11-29 05:34:39,121 INFO L140 encePairwiseOnDemand]: 659/676 looper letters, 69 selfloop transitions, 19 changer transitions 0/632 dead transitions. [2023-11-29 05:34:39,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 632 transitions, 1532 flow [2023-11-29 05:34:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:34:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:34:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7481 transitions. [2023-11-29 05:34:39,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9222140039447732 [2023-11-29 05:34:39,134 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7481 transitions. [2023-11-29 05:34:39,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7481 transitions. [2023-11-29 05:34:39,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:39,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7481 transitions. [2023-11-29 05:34:39,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 623.4166666666666) internal successors, (7481), 12 states have internal predecessors, (7481), 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-29 05:34:39,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:39,147 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:39,147 INFO L175 Difference]: Start difference. First operand has 588 places, 591 transitions, 1256 flow. Second operand 12 states and 7481 transitions. [2023-11-29 05:34:39,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 632 transitions, 1532 flow [2023-11-29 05:34:39,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 632 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:39,156 INFO L231 Difference]: Finished difference. Result has 603 places, 601 transitions, 1353 flow [2023-11-29 05:34:39,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1353, PETRI_PLACES=603, PETRI_TRANSITIONS=601} [2023-11-29 05:34:39,158 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -22 predicate places. [2023-11-29 05:34:39,158 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 601 transitions, 1353 flow [2023-11-29 05:34:39,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.125) internal successors, (4961), 8 states have internal predecessors, (4961), 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-29 05:34:39,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:39,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:39,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:34:39,159 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:39,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1056305681, now seen corresponding path program 1 times [2023-11-29 05:34:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349127205] [2023-11-29 05:34:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,218 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-29 05:34:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349127205] [2023-11-29 05:34:39,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349127205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:39,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:39,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:39,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950995272] [2023-11-29 05:34:39,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:39,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:39,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:34:39,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 601 transitions, 1353 flow. Second operand has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:34:39,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:39,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:34:39,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:40,572 INFO L124 PetriNetUnfolderBase]: 369/5056 cut-off events. [2023-11-29 05:34:40,572 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 05:34:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 5056 events. 369/5056 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 44521 event pairs, 42 based on Foata normal form. 0/4470 useless extension candidates. Maximal degree in co-relation 5759. Up to 280 conditions per place. [2023-11-29 05:34:40,659 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 20 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2023-11-29 05:34:40,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 604 transitions, 1408 flow [2023-11-29 05:34:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1955 transitions. [2023-11-29 05:34:40,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640039447731755 [2023-11-29 05:34:40,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1955 transitions. [2023-11-29 05:34:40,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1955 transitions. [2023-11-29 05:34:40,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:40,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1955 transitions. [2023-11-29 05:34:40,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 651.6666666666666) internal successors, (1955), 3 states have internal predecessors, (1955), 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-29 05:34:40,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:40,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:40,673 INFO L175 Difference]: Start difference. First operand has 603 places, 601 transitions, 1353 flow. Second operand 3 states and 1955 transitions. [2023-11-29 05:34:40,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 604 transitions, 1408 flow [2023-11-29 05:34:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 604 transitions, 1408 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:40,690 INFO L231 Difference]: Finished difference. Result has 602 places, 599 transitions, 1359 flow [2023-11-29 05:34:40,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=602, PETRI_TRANSITIONS=599} [2023-11-29 05:34:40,692 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -23 predicate places. [2023-11-29 05:34:40,692 INFO L495 AbstractCegarLoop]: Abstraction has has 602 places, 599 transitions, 1359 flow [2023-11-29 05:34:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:34:40,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:40,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:40,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:34:40,693 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:40,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1431425599, now seen corresponding path program 1 times [2023-11-29 05:34:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639957025] [2023-11-29 05:34:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:40,778 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-29 05:34:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639957025] [2023-11-29 05:34:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639957025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394297905] [2023-11-29 05:34:40,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:40,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:40,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:40,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:40,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:40,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:40,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 599 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:40,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:40,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:40,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:41,788 INFO L124 PetriNetUnfolderBase]: 263/3446 cut-off events. [2023-11-29 05:34:41,788 INFO L125 PetriNetUnfolderBase]: For 139/176 co-relation queries the response was YES. [2023-11-29 05:34:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 3446 events. 263/3446 cut-off events. For 139/176 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 28767 event pairs, 54 based on Foata normal form. 6/3036 useless extension candidates. Maximal degree in co-relation 3946. Up to 213 conditions per place. [2023-11-29 05:34:41,833 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2023-11-29 05:34:41,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 600 transitions, 1393 flow [2023-11-29 05:34:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:41,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:41,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:41,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:41,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:41,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:41,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:41,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:41,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:41,843 INFO L175 Difference]: Start difference. First operand has 602 places, 599 transitions, 1359 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:41,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 600 transitions, 1393 flow [2023-11-29 05:34:41,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 600 transitions, 1393 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:41,855 INFO L231 Difference]: Finished difference. Result has 603 places, 598 transitions, 1361 flow [2023-11-29 05:34:41,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=603, PETRI_TRANSITIONS=598} [2023-11-29 05:34:41,857 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -22 predicate places. [2023-11-29 05:34:41,857 INFO L495 AbstractCegarLoop]: Abstraction has has 603 places, 598 transitions, 1361 flow [2023-11-29 05:34:41,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:41,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:41,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:41,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:34:41,858 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:41,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1031861442, now seen corresponding path program 1 times [2023-11-29 05:34:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341730065] [2023-11-29 05:34:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:41,926 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-29 05:34:41,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341730065] [2023-11-29 05:34:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341730065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492182900] [2023-11-29 05:34:41,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:41,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:41,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 598 transitions, 1361 flow. Second operand has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:41,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:41,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:41,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:43,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1759] L90-->L90-1: Formula: (= |v_#race~get1~0_7| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_7|} AuxVars[] AssignedVars[#race~get1~0][467], [723#(= |#race~count3~0| 0), 583#L77-6true, Black: 711#true, 467#L50-1true, 798#true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 716#true, Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), 794#true, Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 638#L122-4true, Black: 721#true, Black: 789#true, Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 791#(= |#race~get2~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 697#(= |#race~n2~0| 0), 146#L90-1true, 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), 705#(= |#race~n3~0| 0), 762#true, 713#(= |#race~count1~0| 0)]) [2023-11-29 05:34:43,139 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2023-11-29 05:34:43,139 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-29 05:34:43,139 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-29 05:34:43,139 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-29 05:34:43,333 INFO L124 PetriNetUnfolderBase]: 442/6739 cut-off events. [2023-11-29 05:34:43,333 INFO L125 PetriNetUnfolderBase]: For 101/166 co-relation queries the response was YES. [2023-11-29 05:34:43,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7595 conditions, 6739 events. 442/6739 cut-off events. For 101/166 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 66678 event pairs, 36 based on Foata normal form. 7/5940 useless extension candidates. Maximal degree in co-relation 7502. Up to 170 conditions per place. [2023-11-29 05:34:43,417 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2023-11-29 05:34:43,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 599 transitions, 1395 flow [2023-11-29 05:34:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:43,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:43,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:43,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:43,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:43,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:43,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:43,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:43,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:43,426 INFO L175 Difference]: Start difference. First operand has 603 places, 598 transitions, 1361 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 599 transitions, 1395 flow [2023-11-29 05:34:43,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 599 transitions, 1391 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:43,434 INFO L231 Difference]: Finished difference. Result has 602 places, 597 transitions, 1359 flow [2023-11-29 05:34:43,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=602, PETRI_TRANSITIONS=597} [2023-11-29 05:34:43,435 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -23 predicate places. [2023-11-29 05:34:43,435 INFO L495 AbstractCegarLoop]: Abstraction has has 602 places, 597 transitions, 1359 flow [2023-11-29 05:34:43,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:34:43,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:43,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:43,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:34:43,436 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:43,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 873171191, now seen corresponding path program 1 times [2023-11-29 05:34:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:43,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310898919] [2023-11-29 05:34:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:43,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:43,660 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-29 05:34:43,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:43,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310898919] [2023-11-29 05:34:43,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310898919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:43,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192576918] [2023-11-29 05:34:43,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:43,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:44,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:34:44,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 597 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 620.25) internal successors, (4962), 8 states have internal predecessors, (4962), 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-29 05:34:44,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:44,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:34:44,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:46,807 INFO L124 PetriNetUnfolderBase]: 701/8970 cut-off events. [2023-11-29 05:34:46,807 INFO L125 PetriNetUnfolderBase]: For 215/333 co-relation queries the response was YES. [2023-11-29 05:34:46,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10600 conditions, 8970 events. 701/8970 cut-off events. For 215/333 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 99688 event pairs, 122 based on Foata normal form. 20/7943 useless extension candidates. Maximal degree in co-relation 10505. Up to 375 conditions per place. [2023-11-29 05:34:46,949 INFO L140 encePairwiseOnDemand]: 659/676 looper letters, 65 selfloop transitions, 19 changer transitions 0/629 dead transitions. [2023-11-29 05:34:46,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 629 transitions, 1609 flow [2023-11-29 05:34:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:34:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:34:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7472 transitions. [2023-11-29 05:34:46,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9211045364891519 [2023-11-29 05:34:46,958 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7472 transitions. [2023-11-29 05:34:46,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7472 transitions. [2023-11-29 05:34:46,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:46,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7472 transitions. [2023-11-29 05:34:46,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 622.6666666666666) internal successors, (7472), 12 states have internal predecessors, (7472), 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-29 05:34:46,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:46,976 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:46,976 INFO L175 Difference]: Start difference. First operand has 602 places, 597 transitions, 1359 flow. Second operand 12 states and 7472 transitions. [2023-11-29 05:34:46,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 629 transitions, 1609 flow [2023-11-29 05:34:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 629 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:46,989 INFO L231 Difference]: Finished difference. Result has 617 places, 607 transitions, 1456 flow [2023-11-29 05:34:46,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1456, PETRI_PLACES=617, PETRI_TRANSITIONS=607} [2023-11-29 05:34:46,991 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -8 predicate places. [2023-11-29 05:34:46,991 INFO L495 AbstractCegarLoop]: Abstraction has has 617 places, 607 transitions, 1456 flow [2023-11-29 05:34:46,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.25) internal successors, (4962), 8 states have internal predecessors, (4962), 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-29 05:34:46,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:46,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:46,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:34:46,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:46,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1330030803, now seen corresponding path program 1 times [2023-11-29 05:34:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329849054] [2023-11-29 05:34:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,058 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-29 05:34:47,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329849054] [2023-11-29 05:34:47,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329849054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:47,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:47,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:34:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234302856] [2023-11-29 05:34:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:47,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:47,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:47,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 607 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:34:47,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:47,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:47,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:48,793 INFO L124 PetriNetUnfolderBase]: 728/7301 cut-off events. [2023-11-29 05:34:48,793 INFO L125 PetriNetUnfolderBase]: For 458/539 co-relation queries the response was YES. [2023-11-29 05:34:48,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9058 conditions, 7301 events. 728/7301 cut-off events. For 458/539 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 76884 event pairs, 204 based on Foata normal form. 8/6372 useless extension candidates. Maximal degree in co-relation 8956. Up to 755 conditions per place. [2023-11-29 05:34:48,892 INFO L140 encePairwiseOnDemand]: 672/676 looper letters, 14 selfloop transitions, 3 changer transitions 0/610 dead transitions. [2023-11-29 05:34:48,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 610 transitions, 1498 flow [2023-11-29 05:34:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2023-11-29 05:34:48,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9674556213017751 [2023-11-29 05:34:48,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1962 transitions. [2023-11-29 05:34:48,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1962 transitions. [2023-11-29 05:34:48,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:48,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1962 transitions. [2023-11-29 05:34:48,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.0) internal successors, (1962), 3 states have internal predecessors, (1962), 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-29 05:34:48,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:48,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:48,897 INFO L175 Difference]: Start difference. First operand has 617 places, 607 transitions, 1456 flow. Second operand 3 states and 1962 transitions. [2023-11-29 05:34:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 610 transitions, 1498 flow [2023-11-29 05:34:48,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 610 transitions, 1498 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:34:48,908 INFO L231 Difference]: Finished difference. Result has 621 places, 608 transitions, 1474 flow [2023-11-29 05:34:48,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=621, PETRI_TRANSITIONS=608} [2023-11-29 05:34:48,909 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -4 predicate places. [2023-11-29 05:34:48,909 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 608 transitions, 1474 flow [2023-11-29 05:34:48,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 650.3333333333334) internal successors, (1951), 3 states have internal predecessors, (1951), 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-29 05:34:48,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:48,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:48,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:34:48,909 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:48,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 549976026, now seen corresponding path program 1 times [2023-11-29 05:34:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:48,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198006978] [2023-11-29 05:34:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:48,980 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-29 05:34:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198006978] [2023-11-29 05:34:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198006978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:48,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:48,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:34:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451647826] [2023-11-29 05:34:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:48,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:34:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:34:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:34:48,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:34:49,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 608 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:49,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:49,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:34:49,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:50,577 INFO L124 PetriNetUnfolderBase]: 491/6047 cut-off events. [2023-11-29 05:34:50,577 INFO L125 PetriNetUnfolderBase]: For 395/447 co-relation queries the response was YES. [2023-11-29 05:34:50,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7661 conditions, 6047 events. 491/6047 cut-off events. For 395/447 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 59453 event pairs, 86 based on Foata normal form. 13/5471 useless extension candidates. Maximal degree in co-relation 7557. Up to 412 conditions per place. [2023-11-29 05:34:50,644 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2023-11-29 05:34:50,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 609 transitions, 1508 flow [2023-11-29 05:34:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:34:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:34:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:34:50,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:34:50,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:34:50,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:34:50,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:50,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:34:50,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:34:50,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:50,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:34:50,649 INFO L175 Difference]: Start difference. First operand has 621 places, 608 transitions, 1474 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:34:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 609 transitions, 1508 flow [2023-11-29 05:34:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 609 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:50,660 INFO L231 Difference]: Finished difference. Result has 620 places, 607 transitions, 1470 flow [2023-11-29 05:34:50,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=620, PETRI_TRANSITIONS=607} [2023-11-29 05:34:50,661 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, -5 predicate places. [2023-11-29 05:34:50,661 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 607 transitions, 1470 flow [2023-11-29 05:34:50,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:34:50,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:50,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:50,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:34:50,661 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:50,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1629474740, now seen corresponding path program 1 times [2023-11-29 05:34:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657505374] [2023-11-29 05:34:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,841 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-29 05:34:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657505374] [2023-11-29 05:34:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657505374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:50,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:50,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642576197] [2023-11-29 05:34:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:50,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:51,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:34:51,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 607 transitions, 1470 flow. Second operand has 8 states, 8 states have (on average 620.375) internal successors, (4963), 8 states have internal predecessors, (4963), 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-29 05:34:51,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:51,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:34:51,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:52,682 INFO L124 PetriNetUnfolderBase]: 630/6134 cut-off events. [2023-11-29 05:34:52,682 INFO L125 PetriNetUnfolderBase]: For 447/477 co-relation queries the response was YES. [2023-11-29 05:34:52,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8220 conditions, 6134 events. 630/6134 cut-off events. For 447/477 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 60027 event pairs, 179 based on Foata normal form. 19/5534 useless extension candidates. Maximal degree in co-relation 8114. Up to 682 conditions per place. [2023-11-29 05:34:52,760 INFO L140 encePairwiseOnDemand]: 659/676 looper letters, 79 selfloop transitions, 19 changer transitions 0/648 dead transitions. [2023-11-29 05:34:52,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 648 transitions, 1800 flow [2023-11-29 05:34:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:34:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:34:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7481 transitions. [2023-11-29 05:34:52,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9222140039447732 [2023-11-29 05:34:52,767 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7481 transitions. [2023-11-29 05:34:52,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7481 transitions. [2023-11-29 05:34:52,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:52,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7481 transitions. [2023-11-29 05:34:52,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 623.4166666666666) internal successors, (7481), 12 states have internal predecessors, (7481), 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-29 05:34:52,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:52,777 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:52,778 INFO L175 Difference]: Start difference. First operand has 620 places, 607 transitions, 1470 flow. Second operand 12 states and 7481 transitions. [2023-11-29 05:34:52,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 648 transitions, 1800 flow [2023-11-29 05:34:52,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 648 transitions, 1796 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:34:52,789 INFO L231 Difference]: Finished difference. Result has 633 places, 612 transitions, 1546 flow [2023-11-29 05:34:52,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1546, PETRI_PLACES=633, PETRI_TRANSITIONS=612} [2023-11-29 05:34:52,790 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 8 predicate places. [2023-11-29 05:34:52,790 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 612 transitions, 1546 flow [2023-11-29 05:34:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.375) internal successors, (4963), 8 states have internal predecessors, (4963), 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-29 05:34:52,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:52,791 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, 1, 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-29 05:34:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 05:34:52,791 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:52,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash 647185664, now seen corresponding path program 1 times [2023-11-29 05:34:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093717624] [2023-11-29 05:34:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:34:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093717624] [2023-11-29 05:34:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093717624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:52,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310091561] [2023-11-29 05:34:52,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:52,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:52,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:53,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:34:53,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 612 transitions, 1546 flow. Second operand has 8 states, 8 states have (on average 620.25) internal successors, (4962), 8 states have internal predecessors, (4962), 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-29 05:34:53,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:53,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:34:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:54,756 INFO L124 PetriNetUnfolderBase]: 416/5942 cut-off events. [2023-11-29 05:34:54,756 INFO L125 PetriNetUnfolderBase]: For 443/461 co-relation queries the response was YES. [2023-11-29 05:34:54,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 5942 events. 416/5942 cut-off events. For 443/461 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 55524 event pairs, 52 based on Foata normal form. 7/5496 useless extension candidates. Maximal degree in co-relation 7892. Up to 215 conditions per place. [2023-11-29 05:34:54,841 INFO L140 encePairwiseOnDemand]: 659/676 looper letters, 71 selfloop transitions, 26 changer transitions 0/647 dead transitions. [2023-11-29 05:34:54,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 647 transitions, 1869 flow [2023-11-29 05:34:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:34:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:34:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7474 transitions. [2023-11-29 05:34:54,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9213510848126233 [2023-11-29 05:34:54,846 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7474 transitions. [2023-11-29 05:34:54,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7474 transitions. [2023-11-29 05:34:54,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:54,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7474 transitions. [2023-11-29 05:34:54,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 622.8333333333334) internal successors, (7474), 12 states have internal predecessors, (7474), 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-29 05:34:54,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:54,858 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 676.0) internal successors, (8788), 13 states have internal predecessors, (8788), 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-29 05:34:54,858 INFO L175 Difference]: Start difference. First operand has 633 places, 612 transitions, 1546 flow. Second operand 12 states and 7474 transitions. [2023-11-29 05:34:54,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 647 transitions, 1869 flow [2023-11-29 05:34:54,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 647 transitions, 1852 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:34:54,875 INFO L231 Difference]: Finished difference. Result has 642 places, 622 transitions, 1682 flow [2023-11-29 05:34:54,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1682, PETRI_PLACES=642, PETRI_TRANSITIONS=622} [2023-11-29 05:34:54,877 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 17 predicate places. [2023-11-29 05:34:54,877 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 622 transitions, 1682 flow [2023-11-29 05:34:54,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.25) internal successors, (4962), 8 states have internal predecessors, (4962), 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-29 05:34:54,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:54,878 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, 1, 1, 1, 1, 1, 1, 1, 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-29 05:34:54,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 05:34:54,878 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:54,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1431643440, now seen corresponding path program 1 times [2023-11-29 05:34:54,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:54,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524847963] [2023-11-29 05:34:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:55,614 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-29 05:34:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524847963] [2023-11-29 05:34:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524847963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:55,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:55,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:34:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228079475] [2023-11-29 05:34:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:55,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:34:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:34:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:34:56,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 676 [2023-11-29 05:34:56,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 622 transitions, 1682 flow. Second operand has 6 states, 6 states have (on average 635.8333333333334) internal successors, (3815), 6 states have internal predecessors, (3815), 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-29 05:34:56,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:56,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 676 [2023-11-29 05:34:56,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:34:57,251 INFO L124 PetriNetUnfolderBase]: 210/3789 cut-off events. [2023-11-29 05:34:57,251 INFO L125 PetriNetUnfolderBase]: For 349/366 co-relation queries the response was YES. [2023-11-29 05:34:57,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4980 conditions, 3789 events. 210/3789 cut-off events. For 349/366 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 29739 event pairs, 0 based on Foata normal form. 8/3515 useless extension candidates. Maximal degree in co-relation 4859. Up to 80 conditions per place. [2023-11-29 05:34:57,300 INFO L140 encePairwiseOnDemand]: 671/676 looper letters, 21 selfloop transitions, 4 changer transitions 0/621 dead transitions. [2023-11-29 05:34:57,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 621 transitions, 1730 flow [2023-11-29 05:34:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:34:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:34:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3830 transitions. [2023-11-29 05:34:57,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9442800788954635 [2023-11-29 05:34:57,303 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3830 transitions. [2023-11-29 05:34:57,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3830 transitions. [2023-11-29 05:34:57,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:34:57,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3830 transitions. [2023-11-29 05:34:57,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 638.3333333333334) internal successors, (3830), 6 states have internal predecessors, (3830), 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-29 05:34:57,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:57,308 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:34:57,308 INFO L175 Difference]: Start difference. First operand has 642 places, 622 transitions, 1682 flow. Second operand 6 states and 3830 transitions. [2023-11-29 05:34:57,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 621 transitions, 1730 flow [2023-11-29 05:34:57,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 621 transitions, 1713 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:34:57,319 INFO L231 Difference]: Finished difference. Result has 640 places, 621 transitions, 1671 flow [2023-11-29 05:34:57,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1671, PETRI_PLACES=640, PETRI_TRANSITIONS=621} [2023-11-29 05:34:57,320 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 15 predicate places. [2023-11-29 05:34:57,320 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 621 transitions, 1671 flow [2023-11-29 05:34:57,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 635.8333333333334) internal successors, (3815), 6 states have internal predecessors, (3815), 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-29 05:34:57,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:34:57,321 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, 1, 1, 1, 1, 1, 1, 1, 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-29 05:34:57,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 05:34:57,321 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:34:57,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1888342875, now seen corresponding path program 1 times [2023-11-29 05:34:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955385204] [2023-11-29 05:34:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:34:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955385204] [2023-11-29 05:34:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955385204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:57,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:57,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863690345] [2023-11-29 05:34:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:57,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:57,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:57,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:34:57,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 621 transitions, 1671 flow. Second operand has 8 states, 8 states have (on average 620.375) internal successors, (4963), 8 states have internal predecessors, (4963), 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-29 05:34:57,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:34:57,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:34:57,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:00,705 INFO L124 PetriNetUnfolderBase]: 940/11572 cut-off events. [2023-11-29 05:35:00,705 INFO L125 PetriNetUnfolderBase]: For 1296/1431 co-relation queries the response was YES. [2023-11-29 05:35:00,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16123 conditions, 11572 events. 940/11572 cut-off events. For 1296/1431 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 133837 event pairs, 192 based on Foata normal form. 18/10665 useless extension candidates. Maximal degree in co-relation 16001. Up to 594 conditions per place. [2023-11-29 05:35:00,894 INFO L140 encePairwiseOnDemand]: 660/676 looper letters, 70 selfloop transitions, 21 changer transitions 0/650 dead transitions. [2023-11-29 05:35:00,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 650 transitions, 1968 flow [2023-11-29 05:35:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:35:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 05:35:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6846 transitions. [2023-11-29 05:35:00,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9206562668101129 [2023-11-29 05:35:00,899 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6846 transitions. [2023-11-29 05:35:00,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6846 transitions. [2023-11-29 05:35:00,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:00,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6846 transitions. [2023-11-29 05:35:00,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 622.3636363636364) internal successors, (6846), 11 states have internal predecessors, (6846), 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-29 05:35:00,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 676.0) internal successors, (8112), 12 states have internal predecessors, (8112), 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-29 05:35:00,909 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 676.0) internal successors, (8112), 12 states have internal predecessors, (8112), 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-29 05:35:00,909 INFO L175 Difference]: Start difference. First operand has 640 places, 621 transitions, 1671 flow. Second operand 11 states and 6846 transitions. [2023-11-29 05:35:00,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 650 transitions, 1968 flow [2023-11-29 05:35:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 650 transitions, 1961 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:00,928 INFO L231 Difference]: Finished difference. Result has 651 places, 635 transitions, 1818 flow [2023-11-29 05:35:00,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1818, PETRI_PLACES=651, PETRI_TRANSITIONS=635} [2023-11-29 05:35:00,929 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 26 predicate places. [2023-11-29 05:35:00,929 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 635 transitions, 1818 flow [2023-11-29 05:35:00,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.375) internal successors, (4963), 8 states have internal predecessors, (4963), 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-29 05:35:00,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:00,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:00,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 05:35:00,931 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:00,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:00,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1082502699, now seen corresponding path program 1 times [2023-11-29 05:35:00,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049467125] [2023-11-29 05:35:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:35:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049467125] [2023-11-29 05:35:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049467125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:35:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058055148] [2023-11-29 05:35:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:35:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:35:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:35:01,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 676 [2023-11-29 05:35:01,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 635 transitions, 1818 flow. Second operand has 8 states, 8 states have (on average 620.5) internal successors, (4964), 8 states have internal predecessors, (4964), 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-29 05:35:01,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:01,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 676 [2023-11-29 05:35:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:03,582 INFO L124 PetriNetUnfolderBase]: 787/7540 cut-off events. [2023-11-29 05:35:03,583 INFO L125 PetriNetUnfolderBase]: For 1525/1559 co-relation queries the response was YES. [2023-11-29 05:35:03,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11285 conditions, 7540 events. 787/7540 cut-off events. For 1525/1559 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 77555 event pairs, 234 based on Foata normal form. 23/6958 useless extension candidates. Maximal degree in co-relation 11155. Up to 922 conditions per place. [2023-11-29 05:35:03,693 INFO L140 encePairwiseOnDemand]: 660/676 looper letters, 70 selfloop transitions, 21 changer transitions 0/659 dead transitions. [2023-11-29 05:35:03,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 659 transitions, 2105 flow [2023-11-29 05:35:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:35:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 05:35:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6846 transitions. [2023-11-29 05:35:03,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9206562668101129 [2023-11-29 05:35:03,698 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6846 transitions. [2023-11-29 05:35:03,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6846 transitions. [2023-11-29 05:35:03,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:03,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6846 transitions. [2023-11-29 05:35:03,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 622.3636363636364) internal successors, (6846), 11 states have internal predecessors, (6846), 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-29 05:35:03,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 676.0) internal successors, (8112), 12 states have internal predecessors, (8112), 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-29 05:35:03,707 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 676.0) internal successors, (8112), 12 states have internal predecessors, (8112), 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-29 05:35:03,708 INFO L175 Difference]: Start difference. First operand has 651 places, 635 transitions, 1818 flow. Second operand 11 states and 6846 transitions. [2023-11-29 05:35:03,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 659 transitions, 2105 flow [2023-11-29 05:35:03,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 659 transitions, 2101 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:35:03,725 INFO L231 Difference]: Finished difference. Result has 663 places, 644 transitions, 1947 flow [2023-11-29 05:35:03,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1947, PETRI_PLACES=663, PETRI_TRANSITIONS=644} [2023-11-29 05:35:03,726 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 38 predicate places. [2023-11-29 05:35:03,726 INFO L495 AbstractCegarLoop]: Abstraction has has 663 places, 644 transitions, 1947 flow [2023-11-29 05:35:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 620.5) internal successors, (4964), 8 states have internal predecessors, (4964), 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-29 05:35:03,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:03,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:03,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 05:35:03,727 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:03,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1629458288, now seen corresponding path program 1 times [2023-11-29 05:35:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285935350] [2023-11-29 05:35:03,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285935350] [2023-11-29 05:35:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285935350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183934453] [2023-11-29 05:35:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:05,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:05,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 644 transitions, 1947 flow. Second operand has 6 states, 6 states have (on average 629.8333333333334) internal successors, (3779), 6 states have internal predecessors, (3779), 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-29 05:35:05,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:05,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:05,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:07,524 INFO L124 PetriNetUnfolderBase]: 682/10083 cut-off events. [2023-11-29 05:35:07,524 INFO L125 PetriNetUnfolderBase]: For 2543/2581 co-relation queries the response was YES. [2023-11-29 05:35:07,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14662 conditions, 10083 events. 682/10083 cut-off events. For 2543/2581 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 106827 event pairs, 45 based on Foata normal form. 10/9388 useless extension candidates. Maximal degree in co-relation 14528. Up to 286 conditions per place. [2023-11-29 05:35:07,683 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/651 dead transitions. [2023-11-29 05:35:07,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 651 transitions, 2069 flow [2023-11-29 05:35:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:07,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:07,686 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:07,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:07,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:07,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:07,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:07,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:07,691 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:07,691 INFO L175 Difference]: Start difference. First operand has 663 places, 644 transitions, 1947 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:07,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 651 transitions, 2069 flow [2023-11-29 05:35:07,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 651 transitions, 2048 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:35:07,728 INFO L231 Difference]: Finished difference. Result has 660 places, 643 transitions, 1945 flow [2023-11-29 05:35:07,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1945, PETRI_PLACES=660, PETRI_TRANSITIONS=643} [2023-11-29 05:35:07,729 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 35 predicate places. [2023-11-29 05:35:07,729 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 643 transitions, 1945 flow [2023-11-29 05:35:07,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 629.8333333333334) internal successors, (3779), 6 states have internal predecessors, (3779), 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-29 05:35:07,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:07,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:07,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:35:07,730 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:07,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 835058101, now seen corresponding path program 1 times [2023-11-29 05:35:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:07,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21727330] [2023-11-29 05:35:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21727330] [2023-11-29 05:35:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21727330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243353326] [2023-11-29 05:35:08,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:08,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:08,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:08,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:08,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 643 transitions, 1945 flow. Second operand has 6 states, 6 states have (on average 630.0) internal successors, (3780), 6 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:35:08,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:08,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:08,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:11,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1759] L90-->L90-1: Formula: (= |v_#race~get1~0_7| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_7|} AuxVars[] AssignedVars[#race~get1~0][563], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 638#L122-4true, Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), 946#true, Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 146#L90-1true, Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), 954#true, Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, 467#L50-1true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true, 129#L76true]) [2023-11-29 05:35:11,636 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2023-11-29 05:35:11,636 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2023-11-29 05:35:11,637 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-29 05:35:11,637 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2023-11-29 05:35:11,664 INFO L124 PetriNetUnfolderBase]: 734/11039 cut-off events. [2023-11-29 05:35:11,664 INFO L125 PetriNetUnfolderBase]: For 2791/2943 co-relation queries the response was YES. [2023-11-29 05:35:11,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15911 conditions, 11039 events. 734/11039 cut-off events. For 2791/2943 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 119756 event pairs, 70 based on Foata normal form. 11/10242 useless extension candidates. Maximal degree in co-relation 15777. Up to 376 conditions per place. [2023-11-29 05:35:11,784 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/650 dead transitions. [2023-11-29 05:35:11,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 650 transitions, 2067 flow [2023-11-29 05:35:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:11,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:11,789 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:11,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:11,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:11,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:11,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:11,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:11,794 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:11,794 INFO L175 Difference]: Start difference. First operand has 660 places, 643 transitions, 1945 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:11,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 650 transitions, 2067 flow [2023-11-29 05:35:11,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 650 transitions, 2054 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:11,820 INFO L231 Difference]: Finished difference. Result has 660 places, 642 transitions, 1951 flow [2023-11-29 05:35:11,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1951, PETRI_PLACES=660, PETRI_TRANSITIONS=642} [2023-11-29 05:35:11,821 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 35 predicate places. [2023-11-29 05:35:11,821 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 642 transitions, 1951 flow [2023-11-29 05:35:11,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 630.0) internal successors, (3780), 6 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:35:11,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:11,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:11,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 05:35:11,823 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:11,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1122571062, now seen corresponding path program 1 times [2023-11-29 05:35:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752563377] [2023-11-29 05:35:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752563377] [2023-11-29 05:35:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752563377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949480872] [2023-11-29 05:35:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:12,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:12,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:13,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:13,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 642 transitions, 1951 flow. Second operand has 6 states, 6 states have (on average 629.8333333333334) internal successors, (3779), 6 states have internal predecessors, (3779), 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-29 05:35:13,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:13,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:13,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:15,479 INFO L124 PetriNetUnfolderBase]: 655/9966 cut-off events. [2023-11-29 05:35:15,480 INFO L125 PetriNetUnfolderBase]: For 2616/2654 co-relation queries the response was YES. [2023-11-29 05:35:15,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14546 conditions, 9966 events. 655/9966 cut-off events. For 2616/2654 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 105384 event pairs, 45 based on Foata normal form. 10/9314 useless extension candidates. Maximal degree in co-relation 14411. Up to 286 conditions per place. [2023-11-29 05:35:15,642 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/648 dead transitions. [2023-11-29 05:35:15,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 648 transitions, 2067 flow [2023-11-29 05:35:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:15,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:15,645 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:15,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:15,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:15,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:15,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:15,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:15,652 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:15,652 INFO L175 Difference]: Start difference. First operand has 660 places, 642 transitions, 1951 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:15,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 648 transitions, 2067 flow [2023-11-29 05:35:15,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 648 transitions, 2054 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:15,687 INFO L231 Difference]: Finished difference. Result has 659 places, 640 transitions, 1946 flow [2023-11-29 05:35:15,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1946, PETRI_PLACES=659, PETRI_TRANSITIONS=640} [2023-11-29 05:35:15,688 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 34 predicate places. [2023-11-29 05:35:15,688 INFO L495 AbstractCegarLoop]: Abstraction has has 659 places, 640 transitions, 1946 flow [2023-11-29 05:35:15,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 629.8333333333334) internal successors, (3779), 6 states have internal predecessors, (3779), 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-29 05:35:15,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:15,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:15,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 05:35:15,689 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:15,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -667995049, now seen corresponding path program 1 times [2023-11-29 05:35:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:15,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272841177] [2023-11-29 05:35:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:15,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:15,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:15,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272841177] [2023-11-29 05:35:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272841177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473063965] [2023-11-29 05:35:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:15,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:15,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 676 [2023-11-29 05:35:15,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 640 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:35:15,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:15,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 676 [2023-11-29 05:35:15,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:18,306 INFO L124 PetriNetUnfolderBase]: 774/10032 cut-off events. [2023-11-29 05:35:18,306 INFO L125 PetriNetUnfolderBase]: For 1832/1841 co-relation queries the response was YES. [2023-11-29 05:35:18,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13847 conditions, 10032 events. 774/10032 cut-off events. For 1832/1841 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 100318 event pairs, 86 based on Foata normal form. 0/9291 useless extension candidates. Maximal degree in co-relation 13713. Up to 557 conditions per place. [2023-11-29 05:35:18,472 INFO L140 encePairwiseOnDemand]: 670/676 looper letters, 19 selfloop transitions, 2 changer transitions 0/642 dead transitions. [2023-11-29 05:35:18,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 642 transitions, 1996 flow [2023-11-29 05:35:18,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1954 transitions. [2023-11-29 05:35:18,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9635108481262328 [2023-11-29 05:35:18,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1954 transitions. [2023-11-29 05:35:18,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1954 transitions. [2023-11-29 05:35:18,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:18,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1954 transitions. [2023-11-29 05:35:18,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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-29 05:35:18,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:18,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:18,478 INFO L175 Difference]: Start difference. First operand has 659 places, 640 transitions, 1946 flow. Second operand 3 states and 1954 transitions. [2023-11-29 05:35:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 642 transitions, 1996 flow [2023-11-29 05:35:18,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 642 transitions, 1984 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:35:18,505 INFO L231 Difference]: Finished difference. Result has 653 places, 638 transitions, 1940 flow [2023-11-29 05:35:18,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1940, PETRI_PLACES=653, PETRI_TRANSITIONS=638} [2023-11-29 05:35:18,507 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 28 predicate places. [2023-11-29 05:35:18,507 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 638 transitions, 1940 flow [2023-11-29 05:35:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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-29 05:35:18,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:18,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:18,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 05:35:18,508 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:18,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1744154041, now seen corresponding path program 1 times [2023-11-29 05:35:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948460985] [2023-11-29 05:35:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:19,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948460985] [2023-11-29 05:35:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948460985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517461134] [2023-11-29 05:35:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:19,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:19,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 638 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 630.1666666666666) internal successors, (3781), 6 states have internal predecessors, (3781), 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-29 05:35:19,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:19,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:21,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][620], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 529#L124-7true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 976#(= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), 334#L90-4true, Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:21,888 INFO L294 olderBase$Statistics]: this new event has 370 ancestors and is cut-off event [2023-11-29 05:35:21,888 INFO L297 olderBase$Statistics]: existing Event has 370 ancestors and is cut-off event [2023-11-29 05:35:21,888 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2023-11-29 05:35:21,889 INFO L297 olderBase$Statistics]: existing Event has 370 ancestors and is cut-off event [2023-11-29 05:35:21,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][625], [723#(= |#race~count3~0| 0), 977#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 529#L124-7true, 791#(= |#race~get2~0| 0), 148#L90-5true, 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:21,895 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is cut-off event [2023-11-29 05:35:21,895 INFO L297 olderBase$Statistics]: existing Event has 371 ancestors and is cut-off event [2023-11-29 05:35:21,895 INFO L297 olderBase$Statistics]: existing Event has 371 ancestors and is cut-off event [2023-11-29 05:35:21,895 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2023-11-29 05:35:21,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][630], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 791#(= |#race~get2~0| 0), 529#L124-7true, 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), 978#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), 432#L90-6true, Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:21,901 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 05:35:21,901 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:21,901 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:21,901 INFO L297 olderBase$Statistics]: existing Event has 341 ancestors and is cut-off event [2023-11-29 05:35:21,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][636], [723#(= |#race~count3~0| 0), 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 791#(= |#race~get2~0| 0), 529#L124-7true, 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, 119#L90-7true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:21,907 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2023-11-29 05:35:21,907 INFO L297 olderBase$Statistics]: existing Event has 373 ancestors and is cut-off event [2023-11-29 05:35:21,907 INFO L297 olderBase$Statistics]: existing Event has 373 ancestors and is cut-off event [2023-11-29 05:35:21,907 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2023-11-29 05:35:21,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][636], [723#(= |#race~count3~0| 0), 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 791#(= |#race~get2~0| 0), 529#L124-7true, 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), Black: 736#true, 738#(= |#race~get1~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true, 635#L90-8true]) [2023-11-29 05:35:21,912 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2023-11-29 05:35:21,912 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-29 05:35:21,912 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2023-11-29 05:35:21,912 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-29 05:35:21,949 INFO L124 PetriNetUnfolderBase]: 764/8247 cut-off events. [2023-11-29 05:35:21,949 INFO L125 PetriNetUnfolderBase]: For 2728/2760 co-relation queries the response was YES. [2023-11-29 05:35:22,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12746 conditions, 8247 events. 764/8247 cut-off events. For 2728/2760 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 84548 event pairs, 97 based on Foata normal form. 4/7770 useless extension candidates. Maximal degree in co-relation 12611. Up to 460 conditions per place. [2023-11-29 05:35:22,076 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/645 dead transitions. [2023-11-29 05:35:22,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 645 transitions, 2062 flow [2023-11-29 05:35:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:22,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:22,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:22,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:22,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:22,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:22,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:22,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:22,084 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:22,084 INFO L175 Difference]: Start difference. First operand has 653 places, 638 transitions, 1940 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:22,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 645 transitions, 2062 flow [2023-11-29 05:35:22,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 645 transitions, 2062 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:35:22,105 INFO L231 Difference]: Finished difference. Result has 657 places, 637 transitions, 1959 flow [2023-11-29 05:35:22,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1936, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=657, PETRI_TRANSITIONS=637} [2023-11-29 05:35:22,106 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 32 predicate places. [2023-11-29 05:35:22,107 INFO L495 AbstractCegarLoop]: Abstraction has has 657 places, 637 transitions, 1959 flow [2023-11-29 05:35:22,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 630.1666666666666) internal successors, (3781), 6 states have internal predecessors, (3781), 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-29 05:35:22,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:22,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:22,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 05:35:22,107 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:22,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash 694136795, now seen corresponding path program 1 times [2023-11-29 05:35:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735319291] [2023-11-29 05:35:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735319291] [2023-11-29 05:35:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735319291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075532358] [2023-11-29 05:35:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:23,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:23,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 637 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 630.0) internal successors, (3780), 6 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:35:23,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:23,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:23,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:26,467 INFO L124 PetriNetUnfolderBase]: 778/11566 cut-off events. [2023-11-29 05:35:26,467 INFO L125 PetriNetUnfolderBase]: For 3158/3315 co-relation queries the response was YES. [2023-11-29 05:35:26,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17313 conditions, 11566 events. 778/11566 cut-off events. For 3158/3315 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 126480 event pairs, 76 based on Foata normal form. 15/10946 useless extension candidates. Maximal degree in co-relation 17176. Up to 419 conditions per place. [2023-11-29 05:35:26,668 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/643 dead transitions. [2023-11-29 05:35:26,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 643 transitions, 2075 flow [2023-11-29 05:35:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:26,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:26,672 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:26,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:26,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:26,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:26,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:26,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:26,677 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:26,677 INFO L175 Difference]: Start difference. First operand has 657 places, 637 transitions, 1959 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:26,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 643 transitions, 2075 flow [2023-11-29 05:35:26,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 643 transitions, 2062 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:26,709 INFO L231 Difference]: Finished difference. Result has 656 places, 635 transitions, 1954 flow [2023-11-29 05:35:26,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1954, PETRI_PLACES=656, PETRI_TRANSITIONS=635} [2023-11-29 05:35:26,710 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 31 predicate places. [2023-11-29 05:35:26,710 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 635 transitions, 1954 flow [2023-11-29 05:35:26,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 630.0) internal successors, (3780), 6 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:35:26,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:26,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:26,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 05:35:26,711 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:26,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -395662891, now seen corresponding path program 1 times [2023-11-29 05:35:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642942652] [2023-11-29 05:35:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:27,171 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-29 05:35:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642942652] [2023-11-29 05:35:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642942652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:27,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293410851] [2023-11-29 05:35:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:27,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:27,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:27,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 634 out of 676 [2023-11-29 05:35:27,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 635 transitions, 1954 flow. Second operand has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 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-29 05:35:27,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:27,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 634 of 676 [2023-11-29 05:35:27,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:29,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][525], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 982#true, Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 746#(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: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:29,369 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:29,369 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:29,369 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:29,369 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:29,371 INFO L124 PetriNetUnfolderBase]: 360/6133 cut-off events. [2023-11-29 05:35:29,371 INFO L125 PetriNetUnfolderBase]: For 1392/1402 co-relation queries the response was YES. [2023-11-29 05:35:29,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 6133 events. 360/6133 cut-off events. For 1392/1402 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 54614 event pairs, 7 based on Foata normal form. 0/5813 useless extension candidates. Maximal degree in co-relation 8736. Up to 158 conditions per place. [2023-11-29 05:35:29,430 INFO L140 encePairwiseOnDemand]: 671/676 looper letters, 21 selfloop transitions, 4 changer transitions 0/634 dead transitions. [2023-11-29 05:35:29,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 634 transitions, 2002 flow [2023-11-29 05:35:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3830 transitions. [2023-11-29 05:35:29,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9442800788954635 [2023-11-29 05:35:29,433 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3830 transitions. [2023-11-29 05:35:29,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3830 transitions. [2023-11-29 05:35:29,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:29,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3830 transitions. [2023-11-29 05:35:29,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 638.3333333333334) internal successors, (3830), 6 states have internal predecessors, (3830), 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-29 05:35:29,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:29,441 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:29,442 INFO L175 Difference]: Start difference. First operand has 656 places, 635 transitions, 1954 flow. Second operand 6 states and 3830 transitions. [2023-11-29 05:35:29,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 634 transitions, 2002 flow [2023-11-29 05:35:29,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 634 transitions, 1990 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:35:29,465 INFO L231 Difference]: Finished difference. Result has 655 places, 634 transitions, 1948 flow [2023-11-29 05:35:29,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1948, PETRI_PLACES=655, PETRI_TRANSITIONS=634} [2023-11-29 05:35:29,466 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 30 predicate places. [2023-11-29 05:35:29,466 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 634 transitions, 1948 flow [2023-11-29 05:35:29,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 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-29 05:35:29,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:29,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:29,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 05:35:29,467 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:29,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash 720578655, now seen corresponding path program 1 times [2023-11-29 05:35:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641189730] [2023-11-29 05:35:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641189730] [2023-11-29 05:35:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641189730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:35:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591169442] [2023-11-29 05:35:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:29,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:35:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:35:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:35:30,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 676 [2023-11-29 05:35:30,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 634 transitions, 1948 flow. Second operand has 6 states, 6 states have (on average 630.1666666666666) internal successors, (3781), 6 states have internal predecessors, (3781), 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-29 05:35:30,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:30,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 676 [2023-11-29 05:35:30,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:32,763 INFO L124 PetriNetUnfolderBase]: 712/8114 cut-off events. [2023-11-29 05:35:32,763 INFO L125 PetriNetUnfolderBase]: For 2799/2821 co-relation queries the response was YES. [2023-11-29 05:35:32,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12598 conditions, 8114 events. 712/8114 cut-off events. For 2799/2821 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 82020 event pairs, 97 based on Foata normal form. 0/7729 useless extension candidates. Maximal degree in co-relation 12461. Up to 479 conditions per place. [2023-11-29 05:35:32,885 INFO L140 encePairwiseOnDemand]: 668/676 looper letters, 42 selfloop transitions, 6 changer transitions 0/640 dead transitions. [2023-11-29 05:35:32,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 640 transitions, 2064 flow [2023-11-29 05:35:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:35:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:35:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3806 transitions. [2023-11-29 05:35:32,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9383629191321499 [2023-11-29 05:35:32,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3806 transitions. [2023-11-29 05:35:32,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3806 transitions. [2023-11-29 05:35:32,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:32,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3806 transitions. [2023-11-29 05:35:32,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 634.3333333333334) internal successors, (3806), 6 states have internal predecessors, (3806), 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-29 05:35:32,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:32,895 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 676.0) internal successors, (4732), 7 states have internal predecessors, (4732), 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-29 05:35:32,895 INFO L175 Difference]: Start difference. First operand has 655 places, 634 transitions, 1948 flow. Second operand 6 states and 3806 transitions. [2023-11-29 05:35:32,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 640 transitions, 2064 flow [2023-11-29 05:35:32,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 640 transitions, 2057 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:35:32,927 INFO L231 Difference]: Finished difference. Result has 654 places, 632 transitions, 1949 flow [2023-11-29 05:35:32,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1949, PETRI_PLACES=654, PETRI_TRANSITIONS=632} [2023-11-29 05:35:32,928 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 29 predicate places. [2023-11-29 05:35:32,929 INFO L495 AbstractCegarLoop]: Abstraction has has 654 places, 632 transitions, 1949 flow [2023-11-29 05:35:32,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 630.1666666666666) internal successors, (3781), 6 states have internal predecessors, (3781), 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-29 05:35:32,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:32,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:32,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 05:35:32,930 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:32,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 115214421, now seen corresponding path program 1 times [2023-11-29 05:35:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635935717] [2023-11-29 05:35:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635935717] [2023-11-29 05:35:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635935717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:32,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776659916] [2023-11-29 05:35:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:32,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:33,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:35:33,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 632 transitions, 1949 flow. Second operand has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:35:33,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:33,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:35:33,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:35,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][525], [723#(= |#race~count3~0| 0), 479#L125-7true, 996#true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 971#(= |#race~get3~0| 0), 738#(= |#race~get1~0| 0), Black: 736#true, 718#(= |#race~count2~0| 0), 894#(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|)))), 1003#true, 682#(= |#race~n1~0| 0), Black: 869#(<= ~n2~0 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:35,661 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:35,661 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:35,661 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:35,661 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:35,664 INFO L124 PetriNetUnfolderBase]: 711/10975 cut-off events. [2023-11-29 05:35:35,664 INFO L125 PetriNetUnfolderBase]: For 2647/2661 co-relation queries the response was YES. [2023-11-29 05:35:35,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16105 conditions, 10975 events. 711/10975 cut-off events. For 2647/2661 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 115207 event pairs, 57 based on Foata normal form. 0/10458 useless extension candidates. Maximal degree in co-relation 15969. Up to 320 conditions per place. [2023-11-29 05:35:35,838 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2023-11-29 05:35:35,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 633 transitions, 1983 flow [2023-11-29 05:35:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:35:35,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:35:35,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:35:35,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:35:35,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:35,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:35:35,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:35:35,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:35,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:35,843 INFO L175 Difference]: Start difference. First operand has 654 places, 632 transitions, 1949 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:35:35,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 633 transitions, 1983 flow [2023-11-29 05:35:35,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 633 transitions, 1971 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:35:35,871 INFO L231 Difference]: Finished difference. Result has 650 places, 631 transitions, 1939 flow [2023-11-29 05:35:35,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1939, PETRI_PLACES=650, PETRI_TRANSITIONS=631} [2023-11-29 05:35:35,872 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 25 predicate places. [2023-11-29 05:35:35,872 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 631 transitions, 1939 flow [2023-11-29 05:35:35,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.3333333333334) internal successors, (1948), 3 states have internal predecessors, (1948), 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-29 05:35:35,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:35,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 05:35:35,873 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:35,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1214876449, now seen corresponding path program 1 times [2023-11-29 05:35:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959604469] [2023-11-29 05:35:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959604469] [2023-11-29 05:35:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959604469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365912147] [2023-11-29 05:35:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:35,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:35:35,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 631 transitions, 1939 flow. Second operand has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:35:35,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:35,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:35:35,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:38,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][525], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 746#(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: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, 1007#true, Black: 721#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 1003#true, 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:38,767 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:38,767 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:38,767 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:38,767 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:38,771 INFO L124 PetriNetUnfolderBase]: 734/11277 cut-off events. [2023-11-29 05:35:38,771 INFO L125 PetriNetUnfolderBase]: For 2563/2617 co-relation queries the response was YES. [2023-11-29 05:35:38,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16231 conditions, 11277 events. 734/11277 cut-off events. For 2563/2617 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 121057 event pairs, 83 based on Foata normal form. 1/10749 useless extension candidates. Maximal degree in co-relation 16148. Up to 384 conditions per place. [2023-11-29 05:35:38,975 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/632 dead transitions. [2023-11-29 05:35:38,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 632 transitions, 1973 flow [2023-11-29 05:35:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:35:38,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:35:38,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:35:38,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:35:38,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:38,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:35:38,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:35:38,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:38,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:38,981 INFO L175 Difference]: Start difference. First operand has 650 places, 631 transitions, 1939 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:35:38,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 632 transitions, 1973 flow [2023-11-29 05:35:39,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 632 transitions, 1969 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:35:39,009 INFO L231 Difference]: Finished difference. Result has 649 places, 630 transitions, 1937 flow [2023-11-29 05:35:39,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1937, PETRI_PLACES=649, PETRI_TRANSITIONS=630} [2023-11-29 05:35:39,010 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 24 predicate places. [2023-11-29 05:35:39,010 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 630 transitions, 1937 flow [2023-11-29 05:35:39,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.6666666666666) internal successors, (1949), 3 states have internal predecessors, (1949), 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-29 05:35:39,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:39,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:39,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 05:35:39,011 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:39,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -61057219, now seen corresponding path program 1 times [2023-11-29 05:35:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383278127] [2023-11-29 05:35:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:39,063 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-29 05:35:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383278127] [2023-11-29 05:35:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383278127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085367371] [2023-11-29 05:35:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:39,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 676 [2023-11-29 05:35:39,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 630 transitions, 1937 flow. Second operand has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 05:35:39,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:39,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 676 [2023-11-29 05:35:39,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:42,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][525], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 789#true, Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 864#true, 1011#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 746#(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: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, 1007#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 971#(= |#race~get3~0| 0), 738#(= |#race~get1~0| 0), Black: 736#true, 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:42,019 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:42,019 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:42,019 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:42,019 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:42,023 INFO L124 PetriNetUnfolderBase]: 683/10822 cut-off events. [2023-11-29 05:35:42,023 INFO L125 PetriNetUnfolderBase]: For 2571/2585 co-relation queries the response was YES. [2023-11-29 05:35:42,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15656 conditions, 10822 events. 683/10822 cut-off events. For 2571/2585 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 113199 event pairs, 51 based on Foata normal form. 0/10336 useless extension candidates. Maximal degree in co-relation 15533. Up to 320 conditions per place. [2023-11-29 05:35:42,194 INFO L140 encePairwiseOnDemand]: 674/676 looper letters, 10 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2023-11-29 05:35:42,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 629 transitions, 1957 flow [2023-11-29 05:35:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2023-11-29 05:35:42,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9674556213017751 [2023-11-29 05:35:42,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1962 transitions. [2023-11-29 05:35:42,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1962 transitions. [2023-11-29 05:35:42,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:42,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1962 transitions. [2023-11-29 05:35:42,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.0) internal successors, (1962), 3 states have internal predecessors, (1962), 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-29 05:35:42,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:42,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:42,199 INFO L175 Difference]: Start difference. First operand has 649 places, 630 transitions, 1937 flow. Second operand 3 states and 1962 transitions. [2023-11-29 05:35:42,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 629 transitions, 1957 flow [2023-11-29 05:35:42,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 629 transitions, 1953 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:35:42,225 INFO L231 Difference]: Finished difference. Result has 648 places, 629 transitions, 1933 flow [2023-11-29 05:35:42,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=648, PETRI_TRANSITIONS=629} [2023-11-29 05:35:42,226 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 23 predicate places. [2023-11-29 05:35:42,226 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 629 transitions, 1933 flow [2023-11-29 05:35:42,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 05:35:42,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:42,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:42,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 05:35:42,227 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:42,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1980938450, now seen corresponding path program 1 times [2023-11-29 05:35:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256923019] [2023-11-29 05:35:42,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 05:35:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256923019] [2023-11-29 05:35:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256923019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463242197] [2023-11-29 05:35:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:42,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 676 [2023-11-29 05:35:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 629 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:35:42,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 676 [2023-11-29 05:35:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:44,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1768] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][399], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1015#true, Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 515#L97-7true, Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 1011#true, 529#L124-7true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:44,072 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,072 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,072 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2023-11-29 05:35:44,072 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][580], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), 1015#true, Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 1011#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:44,119 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:44,120 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:44,120 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:44,120 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:44,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1768] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][399], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), 1015#true, Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 515#L97-7true, Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 596#L70-1true, 1011#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 170#L123-7true, 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 736#true, 738#(= |#race~get1~0| 0), 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:44,124 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2023-11-29 05:35:44,124 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2023-11-29 05:35:44,124 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2023-11-29 05:35:44,124 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1768] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][399], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1015#true, Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 515#L97-7true, Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 1011#true, 529#L124-7true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:44,129 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:44,129 INFO L124 PetriNetUnfolderBase]: 533/7052 cut-off events. [2023-11-29 05:35:44,129 INFO L125 PetriNetUnfolderBase]: For 1544/1560 co-relation queries the response was YES. [2023-11-29 05:35:44,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10215 conditions, 7052 events. 533/7052 cut-off events. For 1544/1560 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 68079 event pairs, 109 based on Foata normal form. 0/6725 useless extension candidates. Maximal degree in co-relation 10079. Up to 456 conditions per place. [2023-11-29 05:35:44,232 INFO L140 encePairwiseOnDemand]: 673/676 looper letters, 13 selfloop transitions, 2 changer transitions 0/630 dead transitions. [2023-11-29 05:35:44,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 630 transitions, 1967 flow [2023-11-29 05:35:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1960 transitions. [2023-11-29 05:35:44,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664694280078896 [2023-11-29 05:35:44,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1960 transitions. [2023-11-29 05:35:44,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1960 transitions. [2023-11-29 05:35:44,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:44,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1960 transitions. [2023-11-29 05:35:44,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 05:35:44,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:44,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:44,236 INFO L175 Difference]: Start difference. First operand has 648 places, 629 transitions, 1933 flow. Second operand 3 states and 1960 transitions. [2023-11-29 05:35:44,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 630 transitions, 1967 flow [2023-11-29 05:35:44,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 630 transitions, 1966 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:35:44,252 INFO L231 Difference]: Finished difference. Result has 648 places, 628 transitions, 1934 flow [2023-11-29 05:35:44,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=648, PETRI_TRANSITIONS=628} [2023-11-29 05:35:44,253 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 23 predicate places. [2023-11-29 05:35:44,253 INFO L495 AbstractCegarLoop]: Abstraction has has 648 places, 628 transitions, 1934 flow [2023-11-29 05:35:44,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 650.0) internal successors, (1950), 3 states have internal predecessors, (1950), 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-29 05:35:44,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:44,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 05:35:44,254 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:44,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1049922231, now seen corresponding path program 1 times [2023-11-29 05:35:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920147485] [2023-11-29 05:35:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:44,311 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-29 05:35:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:44,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920147485] [2023-11-29 05:35:44,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920147485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:44,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:44,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161500392] [2023-11-29 05:35:44,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:44,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:44,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 676 [2023-11-29 05:35:44,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 628 transitions, 1934 flow. Second operand has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 05:35:44,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:44,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 676 [2023-11-29 05:35:44,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:47,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][525], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), 1015#true, Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 746#(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: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 1019#true, 713#(= |#race~count1~0| 0), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:47,012 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:47,012 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:47,012 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:47,012 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:47,014 INFO L124 PetriNetUnfolderBase]: 688/11115 cut-off events. [2023-11-29 05:35:47,015 INFO L125 PetriNetUnfolderBase]: For 2551/2601 co-relation queries the response was YES. [2023-11-29 05:35:47,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16092 conditions, 11115 events. 688/11115 cut-off events. For 2551/2601 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 119012 event pairs, 76 based on Foata normal form. 0/10672 useless extension candidates. Maximal degree in co-relation 15956. Up to 384 conditions per place. [2023-11-29 05:35:47,126 INFO L140 encePairwiseOnDemand]: 674/676 looper letters, 10 selfloop transitions, 1 changer transitions 0/627 dead transitions. [2023-11-29 05:35:47,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 627 transitions, 1954 flow [2023-11-29 05:35:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2023-11-29 05:35:47,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9674556213017751 [2023-11-29 05:35:47,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1962 transitions. [2023-11-29 05:35:47,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1962 transitions. [2023-11-29 05:35:47,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:47,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1962 transitions. [2023-11-29 05:35:47,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 654.0) internal successors, (1962), 3 states have internal predecessors, (1962), 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-29 05:35:47,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:47,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:47,130 INFO L175 Difference]: Start difference. First operand has 648 places, 628 transitions, 1934 flow. Second operand 3 states and 1962 transitions. [2023-11-29 05:35:47,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 627 transitions, 1954 flow [2023-11-29 05:35:47,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 627 transitions, 1950 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:35:47,155 INFO L231 Difference]: Finished difference. Result has 647 places, 627 transitions, 1930 flow [2023-11-29 05:35:47,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1928, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1930, PETRI_PLACES=647, PETRI_TRANSITIONS=627} [2023-11-29 05:35:47,156 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 22 predicate places. [2023-11-29 05:35:47,156 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 627 transitions, 1930 flow [2023-11-29 05:35:47,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 05:35:47,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:35:47,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:35:47,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 05:35:47,157 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 134 more)] === [2023-11-29 05:35:47,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash -340307671, now seen corresponding path program 1 times [2023-11-29 05:35:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478460585] [2023-11-29 05:35:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:47,209 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-29 05:35:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478460585] [2023-11-29 05:35:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478460585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:47,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:35:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070738777] [2023-11-29 05:35:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:47,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:35:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:35:47,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:35:47,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 676 [2023-11-29 05:35:47,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 627 transitions, 1930 flow. Second operand has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 05:35:47,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:35:47,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 676 [2023-11-29 05:35:47,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:35:48,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1768] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][399], [723#(= |#race~count3~0| 0), Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 515#L97-7true, Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 1023#true, Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 529#L124-7true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 1019#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 721#true, Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:48,849 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 05:35:48,849 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:48,849 INFO L297 olderBase$Statistics]: existing Event has 403 ancestors and is cut-off event [2023-11-29 05:35:48,849 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 05:35:48,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1834] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][580], [723#(= |#race~count3~0| 0), 479#L125-7true, Black: 781#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 775#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 773#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 767#(<= ~n1~0 0), Black: 768#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 909#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1023#true, Black: 902#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 901#(<= ~n3~0 0), Black: 915#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 907#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 789#true, 864#true, 791#(= |#race~get2~0| 0), 697#(= |#race~n2~0| 0), Black: 928#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 941#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 927#(<= ~n3~0 0), Black: 807#(<= ~n2~0 0), Black: 808#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 746#(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: 951#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 813#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 815#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 821#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 802#true, 1019#true, 713#(= |#race~count1~0| 0), Black: 831#(not |thread3Thread1of1ForFork1_#t~short20|), Black: 959#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 839#true, Black: 711#true, Black: 969#true, Black: 716#true, Black: 721#true, Black: 979#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get1~0.offset 1)) 0)), Black: 844#(<= ~n1~0 0), Black: 845#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n1~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(not |thread1Thread1of1ForFork2_#t~short2|), 738#(= |#race~get1~0| 0), Black: 736#true, 971#(= |#race~get3~0| 0), 718#(= |#race~count2~0| 0), 894#(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|)))), 682#(= |#race~n1~0| 0), Black: 754#(not |thread2Thread1of1ForFork0_#t~short11|), Black: 869#(<= ~n2~0 0), 994#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 705#(= |#race~n3~0| 0), Black: 870#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 883#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 762#true]) [2023-11-29 05:35:48,878 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 05:35:48,878 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is not cut-off event [2023-11-29 05:35:48,878 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:48,878 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is not cut-off event [2023-11-29 05:35:48,883 INFO L124 PetriNetUnfolderBase]: 461/6829 cut-off events. [2023-11-29 05:35:48,883 INFO L125 PetriNetUnfolderBase]: For 1500/1516 co-relation queries the response was YES. [2023-11-29 05:35:48,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9866 conditions, 6829 events. 461/6829 cut-off events. For 1500/1516 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 65572 event pairs, 98 based on Foata normal form. 30/6572 useless extension candidates. Maximal degree in co-relation 9730. Up to 384 conditions per place. [2023-11-29 05:35:48,963 INFO L140 encePairwiseOnDemand]: 674/676 looper letters, 0 selfloop transitions, 0 changer transitions 626/626 dead transitions. [2023-11-29 05:35:48,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 626 transitions, 1948 flow [2023-11-29 05:35:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:35:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:35:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1961 transitions. [2023-11-29 05:35:48,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9669625246548323 [2023-11-29 05:35:48,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1961 transitions. [2023-11-29 05:35:48,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1961 transitions. [2023-11-29 05:35:48,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:35:48,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1961 transitions. [2023-11-29 05:35:48,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 653.6666666666666) internal successors, (1961), 3 states have internal predecessors, (1961), 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-29 05:35:48,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:48,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 676.0) internal successors, (2704), 4 states have internal predecessors, (2704), 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-29 05:35:48,968 INFO L175 Difference]: Start difference. First operand has 647 places, 627 transitions, 1930 flow. Second operand 3 states and 1961 transitions. [2023-11-29 05:35:48,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 626 transitions, 1948 flow [2023-11-29 05:35:48,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 626 transitions, 1947 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:35:48,982 INFO L231 Difference]: Finished difference. Result has 647 places, 0 transitions, 0 flow [2023-11-29 05:35:48,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=676, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=647, PETRI_TRANSITIONS=0} [2023-11-29 05:35:48,982 INFO L281 CegarLoopForPetriNet]: 625 programPoint places, 22 predicate places. [2023-11-29 05:35:48,982 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 0 transitions, 0 flow [2023-11-29 05:35:48,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 05:35:48,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (137 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (136 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (135 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (134 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (132 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (131 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (130 of 138 remaining) [2023-11-29 05:35:48,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (129 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (128 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (127 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (123 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (121 of 138 remaining) [2023-11-29 05:35:48,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (120 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (119 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (118 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (117 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (116 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (115 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (113 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (112 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (111 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (110 of 138 remaining) [2023-11-29 05:35:48,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (109 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (108 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (107 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (106 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (105 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (104 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (102 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (101 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (100 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (99 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (98 of 138 remaining) [2023-11-29 05:35:48,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (97 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (96 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (94 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (93 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (92 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (91 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (90 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (89 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (88 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (87 of 138 remaining) [2023-11-29 05:35:48,989 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (86 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (85 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (83 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (82 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (81 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (80 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (79 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (78 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 138 remaining) [2023-11-29 05:35:48,990 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (76 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (75 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (74 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (72 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (69 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (68 of 138 remaining) [2023-11-29 05:35:48,991 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (67 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (64 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (62 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (61 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (60 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 138 remaining) [2023-11-29 05:35:48,992 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 138 remaining) [2023-11-29 05:35:48,993 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 138 remaining) [2023-11-29 05:35:48,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 138 remaining) [2023-11-29 05:35:48,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 138 remaining) [2023-11-29 05:35:48,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 138 remaining) [2023-11-29 05:35:48,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 138 remaining) [2023-11-29 05:35:48,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 138 remaining) [2023-11-29 05:35:48,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 05:35:48,998 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-29 05:35:49,005 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:35:49,005 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:35:49,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:35:49 BasicIcfg [2023-11-29 05:35:49,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:35:49,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:35:49,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:35:49,011 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:35:49,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:33:35" (3/4) ... [2023-11-29 05:35:49,013 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:35:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 05:35:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 05:35:49,017 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 05:35:49,026 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-29 05:35:49,027 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 05:35:49,028 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:35:49,028 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:35:49,117 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:35:49,118 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:35:49,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:35:49,119 INFO L158 Benchmark]: Toolchain (without parser) took 135513.24ms. Allocated memory was 165.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 135.9MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2023-11-29 05:35:49,119 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 81.8MB in the end (delta: 116.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:35:49,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.53ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 121.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:35:49,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.82ms. Allocated memory is still 165.7MB. Free memory was 121.4MB in the beginning and 118.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:35:49,120 INFO L158 Benchmark]: Boogie Preprocessor took 64.01ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 114.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:35:49,120 INFO L158 Benchmark]: RCFGBuilder took 1021.26ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 124.1MB in the end (delta: -9.4MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-11-29 05:35:49,121 INFO L158 Benchmark]: TraceAbstraction took 133977.07ms. Allocated memory was 165.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 123.3MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2023-11-29 05:35:49,121 INFO L158 Benchmark]: Witness Printer took 106.95ms. Allocated memory is still 12.5GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 05:35:49,123 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 81.8MB in the end (delta: 116.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.53ms. Allocated memory is still 165.7MB. Free memory was 135.5MB in the beginning and 121.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.82ms. Allocated memory is still 165.7MB. Free memory was 121.4MB in the beginning and 118.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.01ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 114.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.26ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 124.1MB in the end (delta: -9.4MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * TraceAbstraction took 133977.07ms. Allocated memory was 165.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 123.3MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. * Witness Printer took 106.95ms. Allocated memory is still 12.5GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 971 locations, 138 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 133.8s, OverallIterations: 49, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 124.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8376 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5062 mSDsluCounter, 7869 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6591 mSDsCounter, 2316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13741 IncrementalHoareTripleChecker+Invalid, 16057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2316 mSolverCounterUnsat, 1278 mSDtfsCounter, 13741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1959occurred in iteration=40, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 9182 NumberOfCodeBlocks, 9182 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 9133 ConstructedInterpolants, 0 QuantifiedInterpolants, 11458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 05:35:49,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_395c854e-6bf7-4879-b043-2899ed71267c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE