./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-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_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/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_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/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_4f26d675-043d-49ae-8bac-18a88ebc3480/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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:07:28,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:07:28,853 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 07:07:28,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:07:28,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:07:28,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:07:28,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:07:28,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:07:28,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:07:28,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:07:28,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:07:28,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:07:28,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:07:28,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:07:28,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:07:28,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:07:28,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:07:28,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:07:28,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:07:28,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:07:28,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:07:28,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:07:28,889 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 07:07:28,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:07:28,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:07:28,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:07:28,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:07:28,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:07:28,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:07:28,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:07:28,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:07:28,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:07:28,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:07:28,894 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:07:28,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:07:28,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:07:28,894 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_4f26d675-043d-49ae-8bac-18a88ebc3480/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_4f26d675-043d-49ae-8bac-18a88ebc3480/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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2023-11-29 07:07:29,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:07:29,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:07:29,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:07:29,156 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:07:29,156 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:07:29,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2023-11-29 07:07:31,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:07:32,140 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:07:32,140 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2023-11-29 07:07:32,149 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/data/0f801025f/708bfb0884524056b87c4b3307ff208e/FLAG7a0d6e39a [2023-11-29 07:07:32,163 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/data/0f801025f/708bfb0884524056b87c4b3307ff208e [2023-11-29 07:07:32,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:07:32,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:07:32,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:07:32,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:07:32,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:07:32,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6c29b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32, skipping insertion in model container [2023-11-29 07:07:32,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:07:32,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:07:32,472 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:07:32,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:07:32,542 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:07:32,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32 WrapperNode [2023-11-29 07:07:32,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:07:32,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:07:32,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:07:32,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:07:32,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,610 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 874 [2023-11-29 07:07:32,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:07:32,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:07:32,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:07:32,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:07:32,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:07:32,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:07:32,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:07:32,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:07:32,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (1/1) ... [2023-11-29 07:07:32,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:07:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:07:32,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:07:32,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:07:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:07:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:07:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 07:07:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 07:07:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 07:07:32,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 07:07:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 07:07:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 07:07:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 07:07:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 07:07:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 07:07:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:07:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:07:32,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:07:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:07:32,751 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 07:07:32,896 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:07:32,898 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:07:33,851 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:07:33,879 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:07:33,879 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 07:07:33,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:07:33 BoogieIcfgContainer [2023-11-29 07:07:33,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:07:33,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:07:33,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:07:33,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:07:33,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:07:32" (1/3) ... [2023-11-29 07:07:33,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a24da89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:07:33, skipping insertion in model container [2023-11-29 07:07:33,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:07:32" (2/3) ... [2023-11-29 07:07:33,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a24da89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:07:33, skipping insertion in model container [2023-11-29 07:07:33,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:07:33" (3/3) ... [2023-11-29 07:07:33,914 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2023-11-29 07:07:33,923 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 07:07:33,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:07:33,934 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2023-11-29 07:07:33,935 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 07:07:34,151 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 07:07:34,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1085 places, 1133 transitions, 2287 flow [2023-11-29 07:07:34,962 INFO L124 PetriNetUnfolderBase]: 58/1130 cut-off events. [2023-11-29 07:07:34,962 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 07:07:35,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1130 events. 58/1130 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3903 event pairs, 0 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 857. Up to 2 conditions per place. [2023-11-29 07:07:35,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 1085 places, 1133 transitions, 2287 flow [2023-11-29 07:07:35,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1057 places, 1103 transitions, 2224 flow [2023-11-29 07:07:35,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:07:35,055 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;@5a1fdd34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:07:35,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 284 error locations. [2023-11-29 07:07:35,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 07:07:35,060 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2023-11-29 07:07:35,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 07:07:35,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:35,061 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] [2023-11-29 07:07:35,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:35,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash 741302430, now seen corresponding path program 1 times [2023-11-29 07:07:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957425159] [2023-11-29 07:07:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:35,252 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 07:07:35,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:35,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957425159] [2023-11-29 07:07:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957425159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:35,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505205583] [2023-11-29 07:07:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:35,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:07:35,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1057 places, 1103 transitions, 2224 flow. Second operand has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:35,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:35,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:07:35,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:37,635 INFO L124 PetriNetUnfolderBase]: 227/4435 cut-off events. [2023-11-29 07:07:37,636 INFO L125 PetriNetUnfolderBase]: For 59/66 co-relation queries the response was YES. [2023-11-29 07:07:37,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 4435 events. 227/4435 cut-off events. For 59/66 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 33854 event pairs, 45 based on Foata normal form. 209/3721 useless extension candidates. Maximal degree in co-relation 3765. Up to 110 conditions per place. [2023-11-29 07:07:37,883 INFO L140 encePairwiseOnDemand]: 1112/1133 looper letters, 19 selfloop transitions, 2 changer transitions 2/1084 dead transitions. [2023-11-29 07:07:37,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1058 places, 1084 transitions, 2228 flow [2023-11-29 07:07:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3310 transitions. [2023-11-29 07:07:37,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9738158281847602 [2023-11-29 07:07:37,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3310 transitions. [2023-11-29 07:07:37,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3310 transitions. [2023-11-29 07:07:37,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:37,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3310 transitions. [2023-11-29 07:07:37,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1103.3333333333333) internal successors, (3310), 3 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states 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 07:07:37,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:37,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:37,956 INFO L175 Difference]: Start difference. First operand has 1057 places, 1103 transitions, 2224 flow. Second operand 3 states and 3310 transitions. [2023-11-29 07:07:37,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1058 places, 1084 transitions, 2228 flow [2023-11-29 07:07:37,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1052 places, 1084 transitions, 2216 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 07:07:37,991 INFO L231 Difference]: Finished difference. Result has 1052 places, 1082 transitions, 2174 flow [2023-11-29 07:07:37,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2174, PETRI_DIFFERENCE_MINUEND_PLACES=1050, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1082, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2174, PETRI_PLACES=1052, PETRI_TRANSITIONS=1082} [2023-11-29 07:07:37,999 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -5 predicate places. [2023-11-29 07:07:37,999 INFO L495 AbstractCegarLoop]: Abstraction has has 1052 places, 1082 transitions, 2174 flow [2023-11-29 07:07:38,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:38,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:38,002 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] [2023-11-29 07:07:38,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:07:38,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:38,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1558423897, now seen corresponding path program 1 times [2023-11-29 07:07:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501026569] [2023-11-29 07:07:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:38,066 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 07:07:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501026569] [2023-11-29 07:07:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501026569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002768745] [2023-11-29 07:07:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:38,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:38,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:38,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:07:38,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1052 places, 1082 transitions, 2174 flow. Second operand has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:38,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:38,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:07:38,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:41,964 INFO L124 PetriNetUnfolderBase]: 613/12441 cut-off events. [2023-11-29 07:07:41,965 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2023-11-29 07:07:42,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12675 conditions, 12441 events. 613/12441 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 124170 event pairs, 95 based on Foata normal form. 0/9786 useless extension candidates. Maximal degree in co-relation 12634. Up to 185 conditions per place. [2023-11-29 07:07:42,227 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 19 selfloop transitions, 2 changer transitions 0/1081 dead transitions. [2023-11-29 07:07:42,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1051 places, 1081 transitions, 2214 flow [2023-11-29 07:07:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 07:07:42,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9685201529861724 [2023-11-29 07:07:42,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 07:07:42,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 07:07:42,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:42,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 07:07:42,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states 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 07:07:42,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:42,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:42,266 INFO L175 Difference]: Start difference. First operand has 1052 places, 1082 transitions, 2174 flow. Second operand 3 states and 3292 transitions. [2023-11-29 07:07:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1051 places, 1081 transitions, 2214 flow [2023-11-29 07:07:42,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 1081 transitions, 2210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:42,290 INFO L231 Difference]: Finished difference. Result has 1049 places, 1081 transitions, 2172 flow [2023-11-29 07:07:42,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2168, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1081, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1079, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2172, PETRI_PLACES=1049, PETRI_TRANSITIONS=1081} [2023-11-29 07:07:42,293 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -8 predicate places. [2023-11-29 07:07:42,293 INFO L495 AbstractCegarLoop]: Abstraction has has 1049 places, 1081 transitions, 2172 flow [2023-11-29 07:07:42,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:42,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:42,296 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] [2023-11-29 07:07:42,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:07:42,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:42,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1516877624, now seen corresponding path program 1 times [2023-11-29 07:07:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872104645] [2023-11-29 07:07:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:42,368 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 07:07:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872104645] [2023-11-29 07:07:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872104645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:42,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504969743] [2023-11-29 07:07:42,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:42,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:07:42,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1049 places, 1081 transitions, 2172 flow. Second operand has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:42,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:42,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:07:42,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:43,981 INFO L124 PetriNetUnfolderBase]: 241/3780 cut-off events. [2023-11-29 07:07:43,981 INFO L125 PetriNetUnfolderBase]: For 43/76 co-relation queries the response was YES. [2023-11-29 07:07:44,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 3780 events. 241/3780 cut-off events. For 43/76 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 28674 event pairs, 95 based on Foata normal form. 0/3014 useless extension candidates. Maximal degree in co-relation 3930. Up to 185 conditions per place. [2023-11-29 07:07:44,114 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 19 selfloop transitions, 2 changer transitions 0/1080 dead transitions. [2023-11-29 07:07:44,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 1080 transitions, 2212 flow [2023-11-29 07:07:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 07:07:44,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9685201529861724 [2023-11-29 07:07:44,122 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 07:07:44,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 07:07:44,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:44,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 07:07:44,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states 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 07:07:44,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:44,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:44,141 INFO L175 Difference]: Start difference. First operand has 1049 places, 1081 transitions, 2172 flow. Second operand 3 states and 3292 transitions. [2023-11-29 07:07:44,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1050 places, 1080 transitions, 2212 flow [2023-11-29 07:07:44,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 1080 transitions, 2208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:44,155 INFO L231 Difference]: Finished difference. Result has 1048 places, 1080 transitions, 2170 flow [2023-11-29 07:07:44,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1080, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2170, PETRI_PLACES=1048, PETRI_TRANSITIONS=1080} [2023-11-29 07:07:44,158 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -9 predicate places. [2023-11-29 07:07:44,158 INFO L495 AbstractCegarLoop]: Abstraction has has 1048 places, 1080 transitions, 2170 flow [2023-11-29 07:07:44,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:07:44,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:44,161 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] [2023-11-29 07:07:44,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:07:44,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:44,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1023325623, now seen corresponding path program 1 times [2023-11-29 07:07:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:44,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049751314] [2023-11-29 07:07:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:44,214 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 07:07:44,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:44,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049751314] [2023-11-29 07:07:44,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049751314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:44,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:44,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439855636] [2023-11-29 07:07:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:44,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1091 out of 1133 [2023-11-29 07:07:44,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 1080 transitions, 2170 flow. Second operand has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:44,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:44,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1091 of 1133 [2023-11-29 07:07:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:46,176 INFO L124 PetriNetUnfolderBase]: 246/5559 cut-off events. [2023-11-29 07:07:46,177 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 07:07:46,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 5559 events. 246/5559 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 44404 event pairs, 16 based on Foata normal form. 0/4396 useless extension candidates. Maximal degree in co-relation 5578. Up to 51 conditions per place. [2023-11-29 07:07:46,320 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 18 selfloop transitions, 2 changer transitions 0/1079 dead transitions. [2023-11-29 07:07:46,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1079 transitions, 2208 flow [2023-11-29 07:07:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:07:46,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:07:46,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:07:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:07:46,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:46,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:07:46,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:07:46,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:46,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:46,354 INFO L175 Difference]: Start difference. First operand has 1048 places, 1080 transitions, 2170 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:07:46,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1079 transitions, 2208 flow [2023-11-29 07:07:46,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 1079 transitions, 2204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:46,371 INFO L231 Difference]: Finished difference. Result has 1047 places, 1079 transitions, 2168 flow [2023-11-29 07:07:46,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=1045, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1079, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2168, PETRI_PLACES=1047, PETRI_TRANSITIONS=1079} [2023-11-29 07:07:46,374 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -10 predicate places. [2023-11-29 07:07:46,374 INFO L495 AbstractCegarLoop]: Abstraction has has 1047 places, 1079 transitions, 2168 flow [2023-11-29 07:07:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:46,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:46,375 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] [2023-11-29 07:07:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:07:46,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:46,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1657102122, now seen corresponding path program 1 times [2023-11-29 07:07:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918603797] [2023-11-29 07:07:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:46,428 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 07:07:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918603797] [2023-11-29 07:07:46,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918603797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:46,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493811670] [2023-11-29 07:07:46,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:46,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:46,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1133 [2023-11-29 07:07:46,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 1079 transitions, 2168 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:46,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:46,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1133 [2023-11-29 07:07:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:46,969 INFO L124 PetriNetUnfolderBase]: 74/1626 cut-off events. [2023-11-29 07:07:46,970 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 07:07:47,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 1626 events. 74/1626 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8263 event pairs, 12 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 1622. Up to 40 conditions per place. [2023-11-29 07:07:47,032 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 15 selfloop transitions, 2 changer transitions 0/1078 dead transitions. [2023-11-29 07:07:47,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 1078 transitions, 2200 flow [2023-11-29 07:07:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3300 transitions. [2023-11-29 07:07:47,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.970873786407767 [2023-11-29 07:07:47,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3300 transitions. [2023-11-29 07:07:47,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3300 transitions. [2023-11-29 07:07:47,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:47,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3300 transitions. [2023-11-29 07:07:47,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states 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 07:07:47,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:47,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:47,061 INFO L175 Difference]: Start difference. First operand has 1047 places, 1079 transitions, 2168 flow. Second operand 3 states and 3300 transitions. [2023-11-29 07:07:47,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1048 places, 1078 transitions, 2200 flow [2023-11-29 07:07:47,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 1078 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:47,084 INFO L231 Difference]: Finished difference. Result has 1046 places, 1078 transitions, 2166 flow [2023-11-29 07:07:47,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1076, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2166, PETRI_PLACES=1046, PETRI_TRANSITIONS=1078} [2023-11-29 07:07:47,087 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -11 predicate places. [2023-11-29 07:07:47,088 INFO L495 AbstractCegarLoop]: Abstraction has has 1046 places, 1078 transitions, 2166 flow [2023-11-29 07:07:47,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:47,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:47,089 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 07:07:47,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:07:47,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:47,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1750689404, now seen corresponding path program 1 times [2023-11-29 07:07:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860571423] [2023-11-29 07:07:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:47,139 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 07:07:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860571423] [2023-11-29 07:07:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860571423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785291204] [2023-11-29 07:07:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:47,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:47,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1095 out of 1133 [2023-11-29 07:07:47,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1078 transitions, 2166 flow. Second operand has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:07:47,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:47,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1095 of 1133 [2023-11-29 07:07:47,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:48,671 INFO L124 PetriNetUnfolderBase]: 168/3877 cut-off events. [2023-11-29 07:07:48,672 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 07:07:48,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 3877 events. 168/3877 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26525 event pairs, 10 based on Foata normal form. 0/3080 useless extension candidates. Maximal degree in co-relation 3858. Up to 35 conditions per place. [2023-11-29 07:07:48,820 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 14 selfloop transitions, 2 changer transitions 0/1077 dead transitions. [2023-11-29 07:07:48,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1077 transitions, 2196 flow [2023-11-29 07:07:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3302 transitions. [2023-11-29 07:07:48,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9714621947631656 [2023-11-29 07:07:48,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3302 transitions. [2023-11-29 07:07:48,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3302 transitions. [2023-11-29 07:07:48,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:48,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3302 transitions. [2023-11-29 07:07:48,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states 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 07:07:48,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:48,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:48,843 INFO L175 Difference]: Start difference. First operand has 1046 places, 1078 transitions, 2166 flow. Second operand 3 states and 3302 transitions. [2023-11-29 07:07:48,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 1077 transitions, 2196 flow [2023-11-29 07:07:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1045 places, 1077 transitions, 2192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:48,862 INFO L231 Difference]: Finished difference. Result has 1045 places, 1077 transitions, 2164 flow [2023-11-29 07:07:48,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1077, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1075, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2164, PETRI_PLACES=1045, PETRI_TRANSITIONS=1077} [2023-11-29 07:07:48,865 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -12 predicate places. [2023-11-29 07:07:48,865 INFO L495 AbstractCegarLoop]: Abstraction has has 1045 places, 1077 transitions, 2164 flow [2023-11-29 07:07:48,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:07:48,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:48,867 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] [2023-11-29 07:07:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:07:48,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:48,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 759818156, now seen corresponding path program 1 times [2023-11-29 07:07:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518590831] [2023-11-29 07:07:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:48,923 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 07:07:48,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518590831] [2023-11-29 07:07:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518590831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:48,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142928585] [2023-11-29 07:07:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:48,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:48,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1088 out of 1133 [2023-11-29 07:07:48,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1045 places, 1077 transitions, 2164 flow. Second operand has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:07:48,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:48,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1088 of 1133 [2023-11-29 07:07:48,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:51,792 INFO L124 PetriNetUnfolderBase]: 350/7796 cut-off events. [2023-11-29 07:07:51,792 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 07:07:51,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7899 conditions, 7796 events. 350/7796 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 69443 event pairs, 24 based on Foata normal form. 0/6158 useless extension candidates. Maximal degree in co-relation 7818. Up to 70 conditions per place. [2023-11-29 07:07:52,057 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 21 selfloop transitions, 2 changer transitions 0/1076 dead transitions. [2023-11-29 07:07:52,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1076 transitions, 2208 flow [2023-11-29 07:07:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3288 transitions. [2023-11-29 07:07:52,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673433362753752 [2023-11-29 07:07:52,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3288 transitions. [2023-11-29 07:07:52,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3288 transitions. [2023-11-29 07:07:52,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:52,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3288 transitions. [2023-11-29 07:07:52,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1096.0) internal successors, (3288), 3 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states 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 07:07:52,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:52,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:52,076 INFO L175 Difference]: Start difference. First operand has 1045 places, 1077 transitions, 2164 flow. Second operand 3 states and 3288 transitions. [2023-11-29 07:07:52,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 1076 transitions, 2208 flow [2023-11-29 07:07:52,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1076 transitions, 2204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:52,090 INFO L231 Difference]: Finished difference. Result has 1044 places, 1076 transitions, 2162 flow [2023-11-29 07:07:52,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=1042, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2162, PETRI_PLACES=1044, PETRI_TRANSITIONS=1076} [2023-11-29 07:07:52,092 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -13 predicate places. [2023-11-29 07:07:52,093 INFO L495 AbstractCegarLoop]: Abstraction has has 1044 places, 1076 transitions, 2162 flow [2023-11-29 07:07:52,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:07:52,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:52,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] [2023-11-29 07:07:52,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:07:52,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:52,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 775442071, now seen corresponding path program 1 times [2023-11-29 07:07:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:52,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386540036] [2023-11-29 07:07:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:52,146 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 07:07:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386540036] [2023-11-29 07:07:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386540036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:52,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239676764] [2023-11-29 07:07:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:52,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1091 out of 1133 [2023-11-29 07:07:52,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1076 transitions, 2162 flow. Second operand has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:52,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:52,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1091 of 1133 [2023-11-29 07:07:52,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:53,748 INFO L124 PetriNetUnfolderBase]: 150/3411 cut-off events. [2023-11-29 07:07:53,749 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2023-11-29 07:07:53,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 3411 events. 150/3411 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22878 event pairs, 16 based on Foata normal form. 0/2721 useless extension candidates. Maximal degree in co-relation 3390. Up to 51 conditions per place. [2023-11-29 07:07:53,936 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 18 selfloop transitions, 2 changer transitions 0/1075 dead transitions. [2023-11-29 07:07:53,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1045 places, 1075 transitions, 2200 flow [2023-11-29 07:07:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:07:53,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:07:53,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:07:53,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:07:53,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:53,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:07:53,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:07:53,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:53,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:53,957 INFO L175 Difference]: Start difference. First operand has 1044 places, 1076 transitions, 2162 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:07:53,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1045 places, 1075 transitions, 2200 flow [2023-11-29 07:07:53,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1043 places, 1075 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:53,979 INFO L231 Difference]: Finished difference. Result has 1043 places, 1075 transitions, 2160 flow [2023-11-29 07:07:53,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=1041, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2160, PETRI_PLACES=1043, PETRI_TRANSITIONS=1075} [2023-11-29 07:07:53,982 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -14 predicate places. [2023-11-29 07:07:53,982 INFO L495 AbstractCegarLoop]: Abstraction has has 1043 places, 1075 transitions, 2160 flow [2023-11-29 07:07:53,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:53,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:53,985 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] [2023-11-29 07:07:53,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:07:53,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:53,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 188796491, now seen corresponding path program 1 times [2023-11-29 07:07:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196825477] [2023-11-29 07:07:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,034 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 07:07:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196825477] [2023-11-29 07:07:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196825477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:54,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922010918] [2023-11-29 07:07:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:54,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:54,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1133 [2023-11-29 07:07:54,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 1075 transitions, 2160 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:54,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:54,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1133 [2023-11-29 07:07:54,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:54,660 INFO L124 PetriNetUnfolderBase]: 74/1622 cut-off events. [2023-11-29 07:07:54,660 INFO L125 PetriNetUnfolderBase]: For 9/15 co-relation queries the response was YES. [2023-11-29 07:07:54,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1622 events. 74/1622 cut-off events. For 9/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7892 event pairs, 12 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 1580. Up to 40 conditions per place. [2023-11-29 07:07:54,722 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 15 selfloop transitions, 2 changer transitions 0/1074 dead transitions. [2023-11-29 07:07:54,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 1074 transitions, 2192 flow [2023-11-29 07:07:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3300 transitions. [2023-11-29 07:07:54,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.970873786407767 [2023-11-29 07:07:54,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3300 transitions. [2023-11-29 07:07:54,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3300 transitions. [2023-11-29 07:07:54,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:54,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3300 transitions. [2023-11-29 07:07:54,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states 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 07:07:54,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:54,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:54,740 INFO L175 Difference]: Start difference. First operand has 1043 places, 1075 transitions, 2160 flow. Second operand 3 states and 3300 transitions. [2023-11-29 07:07:54,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 1074 transitions, 2192 flow [2023-11-29 07:07:54,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1042 places, 1074 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:54,755 INFO L231 Difference]: Finished difference. Result has 1042 places, 1074 transitions, 2158 flow [2023-11-29 07:07:54,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=1040, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1072, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2158, PETRI_PLACES=1042, PETRI_TRANSITIONS=1074} [2023-11-29 07:07:54,757 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -15 predicate places. [2023-11-29 07:07:54,758 INFO L495 AbstractCegarLoop]: Abstraction has has 1042 places, 1074 transitions, 2158 flow [2023-11-29 07:07:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:54,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:54,759 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] [2023-11-29 07:07:54,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:07:54,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:54,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1586934559, now seen corresponding path program 1 times [2023-11-29 07:07:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202564522] [2023-11-29 07:07:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:54,795 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 07:07:54,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202564522] [2023-11-29 07:07:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202564522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319292528] [2023-11-29 07:07:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:54,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:54,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:54,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:54,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1095 out of 1133 [2023-11-29 07:07:54,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 1074 transitions, 2158 flow. Second operand has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:07:54,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:54,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1095 of 1133 [2023-11-29 07:07:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:55,800 INFO L124 PetriNetUnfolderBase]: 108/2533 cut-off events. [2023-11-29 07:07:55,800 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 07:07:55,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2582 conditions, 2533 events. 108/2533 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 14495 event pairs, 10 based on Foata normal form. 0/2033 useless extension candidates. Maximal degree in co-relation 2477. Up to 35 conditions per place. [2023-11-29 07:07:55,929 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 14 selfloop transitions, 2 changer transitions 0/1073 dead transitions. [2023-11-29 07:07:55,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1043 places, 1073 transitions, 2188 flow [2023-11-29 07:07:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3302 transitions. [2023-11-29 07:07:55,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9714621947631656 [2023-11-29 07:07:55,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3302 transitions. [2023-11-29 07:07:55,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3302 transitions. [2023-11-29 07:07:55,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:55,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3302 transitions. [2023-11-29 07:07:55,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states 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 07:07:55,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:55,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:55,947 INFO L175 Difference]: Start difference. First operand has 1042 places, 1074 transitions, 2158 flow. Second operand 3 states and 3302 transitions. [2023-11-29 07:07:55,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1043 places, 1073 transitions, 2188 flow [2023-11-29 07:07:55,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1041 places, 1073 transitions, 2184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:55,963 INFO L231 Difference]: Finished difference. Result has 1041 places, 1073 transitions, 2156 flow [2023-11-29 07:07:55,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=1039, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2156, PETRI_PLACES=1041, PETRI_TRANSITIONS=1073} [2023-11-29 07:07:55,966 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -16 predicate places. [2023-11-29 07:07:55,966 INFO L495 AbstractCegarLoop]: Abstraction has has 1041 places, 1073 transitions, 2156 flow [2023-11-29 07:07:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:07:55,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:55,967 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] [2023-11-29 07:07:55,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:07:55,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:55,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1548338626, now seen corresponding path program 1 times [2023-11-29 07:07:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830794283] [2023-11-29 07:07:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:56,010 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 07:07:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830794283] [2023-11-29 07:07:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830794283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072811028] [2023-11-29 07:07:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:56,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:56,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1088 out of 1133 [2023-11-29 07:07:56,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1073 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:07:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1088 of 1133 [2023-11-29 07:07:56,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:58,106 INFO L124 PetriNetUnfolderBase]: 206/4576 cut-off events. [2023-11-29 07:07:58,107 INFO L125 PetriNetUnfolderBase]: For 15/99 co-relation queries the response was YES. [2023-11-29 07:07:58,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 4576 events. 206/4576 cut-off events. For 15/99 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 34687 event pairs, 24 based on Foata normal form. 0/3639 useless extension candidates. Maximal degree in co-relation 4554. Up to 70 conditions per place. [2023-11-29 07:07:58,280 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 21 selfloop transitions, 2 changer transitions 0/1072 dead transitions. [2023-11-29 07:07:58,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1072 transitions, 2200 flow [2023-11-29 07:07:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3288 transitions. [2023-11-29 07:07:58,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673433362753752 [2023-11-29 07:07:58,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3288 transitions. [2023-11-29 07:07:58,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3288 transitions. [2023-11-29 07:07:58,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:58,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3288 transitions. [2023-11-29 07:07:58,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1096.0) internal successors, (3288), 3 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states 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 07:07:58,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:58,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:58,294 INFO L175 Difference]: Start difference. First operand has 1041 places, 1073 transitions, 2156 flow. Second operand 3 states and 3288 transitions. [2023-11-29 07:07:58,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1072 transitions, 2200 flow [2023-11-29 07:07:58,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1040 places, 1072 transitions, 2196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:58,309 INFO L231 Difference]: Finished difference. Result has 1040 places, 1072 transitions, 2154 flow [2023-11-29 07:07:58,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=1038, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1070, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2154, PETRI_PLACES=1040, PETRI_TRANSITIONS=1072} [2023-11-29 07:07:58,311 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -17 predicate places. [2023-11-29 07:07:58,311 INFO L495 AbstractCegarLoop]: Abstraction has has 1040 places, 1072 transitions, 2154 flow [2023-11-29 07:07:58,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:07:58,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:58,311 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] [2023-11-29 07:07:58,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 07:07:58,311 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:58,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1161432532, now seen corresponding path program 1 times [2023-11-29 07:07:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:58,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493293615] [2023-11-29 07:07:58,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:58,356 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 07:07:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493293615] [2023-11-29 07:07:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493293615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:58,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716042533] [2023-11-29 07:07:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:58,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:58,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1091 out of 1133 [2023-11-29 07:07:58,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 1072 transitions, 2154 flow. Second operand has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:58,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:58,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1091 of 1133 [2023-11-29 07:07:58,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:58,950 INFO L124 PetriNetUnfolderBase]: 78/1587 cut-off events. [2023-11-29 07:07:58,951 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2023-11-29 07:07:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1587 events. 78/1587 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7490 event pairs, 16 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1528. Up to 53 conditions per place. [2023-11-29 07:07:59,007 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 18 selfloop transitions, 2 changer transitions 0/1071 dead transitions. [2023-11-29 07:07:59,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1041 places, 1071 transitions, 2192 flow [2023-11-29 07:07:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:07:59,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:07:59,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:07:59,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:07:59,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:59,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:07:59,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:07:59,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:59,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:59,023 INFO L175 Difference]: Start difference. First operand has 1040 places, 1072 transitions, 2154 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:07:59,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1041 places, 1071 transitions, 2192 flow [2023-11-29 07:07:59,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1039 places, 1071 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:59,038 INFO L231 Difference]: Finished difference. Result has 1039 places, 1071 transitions, 2152 flow [2023-11-29 07:07:59,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=1037, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2152, PETRI_PLACES=1039, PETRI_TRANSITIONS=1071} [2023-11-29 07:07:59,041 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -18 predicate places. [2023-11-29 07:07:59,041 INFO L495 AbstractCegarLoop]: Abstraction has has 1039 places, 1071 transitions, 2152 flow [2023-11-29 07:07:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:07:59,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:59,042 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] [2023-11-29 07:07:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 07:07:59,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:59,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1123837388, now seen corresponding path program 1 times [2023-11-29 07:07:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392409324] [2023-11-29 07:07:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,077 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 07:07:59,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:59,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392409324] [2023-11-29 07:07:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392409324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:59,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:59,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:59,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854057015] [2023-11-29 07:07:59,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:59,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:59,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1094 out of 1133 [2023-11-29 07:07:59,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 1071 transitions, 2152 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:59,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:59,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1094 of 1133 [2023-11-29 07:07:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:07:59,649 INFO L124 PetriNetUnfolderBase]: 74/1618 cut-off events. [2023-11-29 07:07:59,649 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2023-11-29 07:07:59,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1618 events. 74/1618 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7394 event pairs, 12 based on Foata normal form. 0/1307 useless extension candidates. Maximal degree in co-relation 1538. Up to 40 conditions per place. [2023-11-29 07:07:59,706 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 15 selfloop transitions, 2 changer transitions 0/1070 dead transitions. [2023-11-29 07:07:59,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 1070 transitions, 2184 flow [2023-11-29 07:07:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:07:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:07:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3300 transitions. [2023-11-29 07:07:59,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.970873786407767 [2023-11-29 07:07:59,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3300 transitions. [2023-11-29 07:07:59,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3300 transitions. [2023-11-29 07:07:59,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:07:59,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3300 transitions. [2023-11-29 07:07:59,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.0) internal successors, (3300), 3 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states 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 07:07:59,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:59,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:07:59,724 INFO L175 Difference]: Start difference. First operand has 1039 places, 1071 transitions, 2152 flow. Second operand 3 states and 3300 transitions. [2023-11-29 07:07:59,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1040 places, 1070 transitions, 2184 flow [2023-11-29 07:07:59,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 1070 transitions, 2180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:07:59,739 INFO L231 Difference]: Finished difference. Result has 1038 places, 1070 transitions, 2150 flow [2023-11-29 07:07:59,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=1036, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1070, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1068, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=1038, PETRI_TRANSITIONS=1070} [2023-11-29 07:07:59,741 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -19 predicate places. [2023-11-29 07:07:59,741 INFO L495 AbstractCegarLoop]: Abstraction has has 1038 places, 1070 transitions, 2150 flow [2023-11-29 07:07:59,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:07:59,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:07:59,742 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 07:07:59,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:07:59,742 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:07:59,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1225030870, now seen corresponding path program 1 times [2023-11-29 07:07:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374089101] [2023-11-29 07:07:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:59,780 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 07:07:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:59,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374089101] [2023-11-29 07:07:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374089101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:07:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:07:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36222704] [2023-11-29 07:07:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:59,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:07:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:07:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:07:59,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1095 out of 1133 [2023-11-29 07:07:59,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1038 places, 1070 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:07:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:07:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1095 of 1133 [2023-11-29 07:07:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:00,214 INFO L124 PetriNetUnfolderBase]: 48/1169 cut-off events. [2023-11-29 07:08:00,214 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-29 07:08:00,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1169 events. 48/1169 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4765 event pairs, 10 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1076. Up to 35 conditions per place. [2023-11-29 07:08:00,260 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 14 selfloop transitions, 2 changer transitions 0/1069 dead transitions. [2023-11-29 07:08:00,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 1069 transitions, 2180 flow [2023-11-29 07:08:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3302 transitions. [2023-11-29 07:08:00,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9714621947631656 [2023-11-29 07:08:00,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3302 transitions. [2023-11-29 07:08:00,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3302 transitions. [2023-11-29 07:08:00,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:00,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3302 transitions. [2023-11-29 07:08:00,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.6666666666667) internal successors, (3302), 3 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states 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 07:08:00,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:00,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:00,278 INFO L175 Difference]: Start difference. First operand has 1038 places, 1070 transitions, 2150 flow. Second operand 3 states and 3302 transitions. [2023-11-29 07:08:00,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 1069 transitions, 2180 flow [2023-11-29 07:08:00,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 1069 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:00,294 INFO L231 Difference]: Finished difference. Result has 1037 places, 1069 transitions, 2148 flow [2023-11-29 07:08:00,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=1035, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1067, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=1037, PETRI_TRANSITIONS=1069} [2023-11-29 07:08:00,296 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -20 predicate places. [2023-11-29 07:08:00,297 INFO L495 AbstractCegarLoop]: Abstraction has has 1037 places, 1069 transitions, 2148 flow [2023-11-29 07:08:00,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1096.3333333333333) internal successors, (3289), 3 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 07:08:00,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:00,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:08:00,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:08:00,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:00,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1294198166, now seen corresponding path program 1 times [2023-11-29 07:08:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253886186] [2023-11-29 07:08:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:00,341 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 07:08:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253886186] [2023-11-29 07:08:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253886186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016878563] [2023-11-29 07:08:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:00,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:00,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1088 out of 1133 [2023-11-29 07:08:00,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 1069 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:08:00,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:00,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1088 of 1133 [2023-11-29 07:08:00,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:00,951 INFO L124 PetriNetUnfolderBase]: 86/1616 cut-off events. [2023-11-29 07:08:00,951 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-29 07:08:00,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1616 events. 86/1616 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8518 event pairs, 24 based on Foata normal form. 0/1308 useless extension candidates. Maximal degree in co-relation 1550. Up to 70 conditions per place. [2023-11-29 07:08:01,008 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 21 selfloop transitions, 2 changer transitions 0/1068 dead transitions. [2023-11-29 07:08:01,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 1068 transitions, 2192 flow [2023-11-29 07:08:01,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3288 transitions. [2023-11-29 07:08:01,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673433362753752 [2023-11-29 07:08:01,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3288 transitions. [2023-11-29 07:08:01,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3288 transitions. [2023-11-29 07:08:01,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:01,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3288 transitions. [2023-11-29 07:08:01,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1096.0) internal successors, (3288), 3 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states 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 07:08:01,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:01,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:01,025 INFO L175 Difference]: Start difference. First operand has 1037 places, 1069 transitions, 2148 flow. Second operand 3 states and 3288 transitions. [2023-11-29 07:08:01,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 1068 transitions, 2192 flow [2023-11-29 07:08:01,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1068 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:01,041 INFO L231 Difference]: Finished difference. Result has 1036 places, 1068 transitions, 2146 flow [2023-11-29 07:08:01,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2142, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1068, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2146, PETRI_PLACES=1036, PETRI_TRANSITIONS=1068} [2023-11-29 07:08:01,043 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -21 predicate places. [2023-11-29 07:08:01,043 INFO L495 AbstractCegarLoop]: Abstraction has has 1036 places, 1068 transitions, 2146 flow [2023-11-29 07:08:01,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1089.3333333333333) internal successors, (3268), 3 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states 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 07:08:01,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:01,044 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] [2023-11-29 07:08:01,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 07:08:01,044 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:01,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2011635566, now seen corresponding path program 1 times [2023-11-29 07:08:01,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506427598] [2023-11-29 07:08:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:01,096 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 07:08:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506427598] [2023-11-29 07:08:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506427598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548940867] [2023-11-29 07:08:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:01,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1097 out of 1133 [2023-11-29 07:08:01,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1068 transitions, 2146 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:01,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:01,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1097 of 1133 [2023-11-29 07:08:01,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:01,877 INFO L124 PetriNetUnfolderBase]: 122/2659 cut-off events. [2023-11-29 07:08:01,877 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2023-11-29 07:08:01,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 2659 events. 122/2659 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 14720 event pairs, 15 based on Foata normal form. 0/2134 useless extension candidates. Maximal degree in co-relation 2562. Up to 43 conditions per place. [2023-11-29 07:08:01,965 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 12 selfloop transitions, 2 changer transitions 0/1067 dead transitions. [2023-11-29 07:08:01,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1067 transitions, 2172 flow [2023-11-29 07:08:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3306 transitions. [2023-11-29 07:08:01,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9726390114739629 [2023-11-29 07:08:01,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3306 transitions. [2023-11-29 07:08:01,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3306 transitions. [2023-11-29 07:08:01,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:01,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3306 transitions. [2023-11-29 07:08:01,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states 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 07:08:01,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:01,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:01,980 INFO L175 Difference]: Start difference. First operand has 1036 places, 1068 transitions, 2146 flow. Second operand 3 states and 3306 transitions. [2023-11-29 07:08:01,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1067 transitions, 2172 flow [2023-11-29 07:08:01,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1035 places, 1067 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:01,993 INFO L231 Difference]: Finished difference. Result has 1035 places, 1067 transitions, 2144 flow [2023-11-29 07:08:01,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1033, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2144, PETRI_PLACES=1035, PETRI_TRANSITIONS=1067} [2023-11-29 07:08:01,994 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -22 predicate places. [2023-11-29 07:08:01,994 INFO L495 AbstractCegarLoop]: Abstraction has has 1035 places, 1067 transitions, 2144 flow [2023-11-29 07:08:01,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:01,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:01,995 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] [2023-11-29 07:08:01,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 07:08:01,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:01,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2145302927, now seen corresponding path program 1 times [2023-11-29 07:08:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:01,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452159681] [2023-11-29 07:08:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:02,795 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 07:08:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:02,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452159681] [2023-11-29 07:08:02,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452159681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:02,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422045931] [2023-11-29 07:08:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:08:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:08:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:02,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1133 [2023-11-29 07:08:02,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1035 places, 1067 transitions, 2144 flow. Second operand has 6 states, 6 states have (on average 1070.5) internal successors, (6423), 6 states have internal predecessors, (6423), 0 states have call successors, (0), 0 states 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 07:08:02,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:02,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1133 [2023-11-29 07:08:02,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:20,267 INFO L124 PetriNetUnfolderBase]: 4081/50053 cut-off events. [2023-11-29 07:08:20,267 INFO L125 PetriNetUnfolderBase]: For 62/143 co-relation queries the response was YES. [2023-11-29 07:08:21,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53013 conditions, 50053 events. 4081/50053 cut-off events. For 62/143 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 717877 event pairs, 1640 based on Foata normal form. 0/39304 useless extension candidates. Maximal degree in co-relation 52801. Up to 2920 conditions per place. [2023-11-29 07:08:21,991 INFO L140 encePairwiseOnDemand]: 1127/1133 looper letters, 38 selfloop transitions, 5 changer transitions 0/1066 dead transitions. [2023-11-29 07:08:21,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 1066 transitions, 2228 flow [2023-11-29 07:08:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:08:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:08:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6458 transitions. [2023-11-29 07:08:22,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9499852897911151 [2023-11-29 07:08:22,003 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 6458 transitions. [2023-11-29 07:08:22,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6458 transitions. [2023-11-29 07:08:22,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:22,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 6458 transitions. [2023-11-29 07:08:22,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1076.3333333333333) internal successors, (6458), 6 states have internal predecessors, (6458), 0 states have call successors, (0), 0 states 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 07:08:22,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1133.0) internal successors, (7931), 7 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states 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 07:08:22,015 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1133.0) internal successors, (7931), 7 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states 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 07:08:22,015 INFO L175 Difference]: Start difference. First operand has 1035 places, 1067 transitions, 2144 flow. Second operand 6 states and 6458 transitions. [2023-11-29 07:08:22,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1039 places, 1066 transitions, 2228 flow [2023-11-29 07:08:22,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1037 places, 1066 transitions, 2224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:22,026 INFO L231 Difference]: Finished difference. Result has 1037 places, 1066 transitions, 2148 flow [2023-11-29 07:08:22,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=1032, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2148, PETRI_PLACES=1037, PETRI_TRANSITIONS=1066} [2023-11-29 07:08:22,028 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -20 predicate places. [2023-11-29 07:08:22,028 INFO L495 AbstractCegarLoop]: Abstraction has has 1037 places, 1066 transitions, 2148 flow [2023-11-29 07:08:22,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1070.5) internal successors, (6423), 6 states have internal predecessors, (6423), 0 states have call successors, (0), 0 states 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 07:08:22,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:22,029 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] [2023-11-29 07:08:22,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 07:08:22,029 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:22,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1671408905, now seen corresponding path program 1 times [2023-11-29 07:08:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097714956] [2023-11-29 07:08:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:22,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:22,087 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 07:08:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097714956] [2023-11-29 07:08:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097714956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328541197] [2023-11-29 07:08:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:22,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:22,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:22,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:22,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1133 [2023-11-29 07:08:22,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1037 places, 1066 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states 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 07:08:22,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:22,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1133 [2023-11-29 07:08:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:22,799 INFO L124 PetriNetUnfolderBase]: 80/1619 cut-off events. [2023-11-29 07:08:22,799 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 07:08:22,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 1619 events. 80/1619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8356 event pairs, 14 based on Foata normal form. 0/1317 useless extension candidates. Maximal degree in co-relation 1682. Up to 43 conditions per place. [2023-11-29 07:08:22,847 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 16 selfloop transitions, 2 changer transitions 0/1067 dead transitions. [2023-11-29 07:08:22,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1038 places, 1067 transitions, 2188 flow [2023-11-29 07:08:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3307 transitions. [2023-11-29 07:08:22,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9729332156516622 [2023-11-29 07:08:22,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3307 transitions. [2023-11-29 07:08:22,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3307 transitions. [2023-11-29 07:08:22,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:22,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3307 transitions. [2023-11-29 07:08:22,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states 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 07:08:22,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:22,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:22,858 INFO L175 Difference]: Start difference. First operand has 1037 places, 1066 transitions, 2148 flow. Second operand 3 states and 3307 transitions. [2023-11-29 07:08:22,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1038 places, 1067 transitions, 2188 flow [2023-11-29 07:08:22,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1067 transitions, 2178 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 07:08:22,870 INFO L231 Difference]: Finished difference. Result has 1033 places, 1065 transitions, 2140 flow [2023-11-29 07:08:22,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1033, PETRI_TRANSITIONS=1065} [2023-11-29 07:08:22,871 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -24 predicate places. [2023-11-29 07:08:22,871 INFO L495 AbstractCegarLoop]: Abstraction has has 1033 places, 1065 transitions, 2140 flow [2023-11-29 07:08:22,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states 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 07:08:22,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:22,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] [2023-11-29 07:08:22,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 07:08:22,872 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:22,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1122773719, now seen corresponding path program 1 times [2023-11-29 07:08:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036433603] [2023-11-29 07:08:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:22,932 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 07:08:22,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036433603] [2023-11-29 07:08:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036433603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:22,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32593826] [2023-11-29 07:08:22,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:22,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:22,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:08:22,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1091.6666666666667) internal successors, (3275), 3 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states 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 07:08:22,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:22,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:08:22,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:23,687 INFO L124 PetriNetUnfolderBase]: 116/2174 cut-off events. [2023-11-29 07:08:23,687 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 07:08:23,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 2174 events. 116/2174 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 13409 event pairs, 26 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 2082. Up to 73 conditions per place. [2023-11-29 07:08:23,781 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 22 selfloop transitions, 2 changer transitions 0/1066 dead transitions. [2023-11-29 07:08:23,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1066 transitions, 2192 flow [2023-11-29 07:08:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3295 transitions. [2023-11-29 07:08:23,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9694027655192704 [2023-11-29 07:08:23,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3295 transitions. [2023-11-29 07:08:23,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3295 transitions. [2023-11-29 07:08:23,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:23,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3295 transitions. [2023-11-29 07:08:23,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:23,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:23,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:23,793 INFO L175 Difference]: Start difference. First operand has 1033 places, 1065 transitions, 2140 flow. Second operand 3 states and 3295 transitions. [2023-11-29 07:08:23,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1066 transitions, 2192 flow [2023-11-29 07:08:23,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1066 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:23,815 INFO L231 Difference]: Finished difference. Result has 1032 places, 1064 transitions, 2138 flow [2023-11-29 07:08:23,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1032, PETRI_TRANSITIONS=1064} [2023-11-29 07:08:23,817 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -25 predicate places. [2023-11-29 07:08:23,817 INFO L495 AbstractCegarLoop]: Abstraction has has 1032 places, 1064 transitions, 2138 flow [2023-11-29 07:08:23,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1091.6666666666667) internal successors, (3275), 3 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states 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 07:08:23,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:23,818 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] [2023-11-29 07:08:23,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 07:08:23,818 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:23,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 294133230, now seen corresponding path program 1 times [2023-11-29 07:08:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937756053] [2023-11-29 07:08:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:23,879 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 07:08:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937756053] [2023-11-29 07:08:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937756053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:23,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:23,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180284418] [2023-11-29 07:08:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:23,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:23,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:23,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:23,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1133 [2023-11-29 07:08:23,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:08:23,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:23,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1133 [2023-11-29 07:08:23,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:24,651 INFO L124 PetriNetUnfolderBase]: 80/1617 cut-off events. [2023-11-29 07:08:24,651 INFO L125 PetriNetUnfolderBase]: For 12/21 co-relation queries the response was YES. [2023-11-29 07:08:24,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 1617 events. 80/1617 cut-off events. For 12/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8053 event pairs, 14 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1469. Up to 43 conditions per place. [2023-11-29 07:08:24,705 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 16 selfloop transitions, 2 changer transitions 0/1065 dead transitions. [2023-11-29 07:08:24,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1065 transitions, 2178 flow [2023-11-29 07:08:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3307 transitions. [2023-11-29 07:08:24,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9729332156516622 [2023-11-29 07:08:24,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3307 transitions. [2023-11-29 07:08:24,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3307 transitions. [2023-11-29 07:08:24,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:24,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3307 transitions. [2023-11-29 07:08:24,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states 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 07:08:24,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:24,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:24,713 INFO L175 Difference]: Start difference. First operand has 1032 places, 1064 transitions, 2138 flow. Second operand 3 states and 3307 transitions. [2023-11-29 07:08:24,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1065 transitions, 2178 flow [2023-11-29 07:08:24,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1065 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:24,725 INFO L231 Difference]: Finished difference. Result has 1031 places, 1063 transitions, 2136 flow [2023-11-29 07:08:24,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1031, PETRI_TRANSITIONS=1063} [2023-11-29 07:08:24,726 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -26 predicate places. [2023-11-29 07:08:24,726 INFO L495 AbstractCegarLoop]: Abstraction has has 1031 places, 1063 transitions, 2136 flow [2023-11-29 07:08:24,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:08:24,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:24,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] [2023-11-29 07:08:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 07:08:24,727 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:24,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash -650911300, now seen corresponding path program 1 times [2023-11-29 07:08:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:24,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77823117] [2023-11-29 07:08:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:24,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:24,768 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 07:08:24,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:24,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77823117] [2023-11-29 07:08:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77823117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808044020] [2023-11-29 07:08:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:24,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:24,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1133 [2023-11-29 07:08:24,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states 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 07:08:24,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:24,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1133 [2023-11-29 07:08:24,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:27,537 INFO L124 PetriNetUnfolderBase]: 441/6325 cut-off events. [2023-11-29 07:08:27,537 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-29 07:08:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6693 conditions, 6325 events. 441/6325 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 53091 event pairs, 110 based on Foata normal form. 0/5062 useless extension candidates. Maximal degree in co-relation 6180. Up to 336 conditions per place. [2023-11-29 07:08:27,783 INFO L140 encePairwiseOnDemand]: 1121/1133 looper letters, 29 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2023-11-29 07:08:27,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1057 transitions, 2188 flow [2023-11-29 07:08:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3269 transitions. [2023-11-29 07:08:27,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.961753456899088 [2023-11-29 07:08:27,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3269 transitions. [2023-11-29 07:08:27,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3269 transitions. [2023-11-29 07:08:27,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:27,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3269 transitions. [2023-11-29 07:08:27,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1089.6666666666667) internal successors, (3269), 3 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states 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 07:08:27,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:27,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:27,795 INFO L175 Difference]: Start difference. First operand has 1031 places, 1063 transitions, 2136 flow. Second operand 3 states and 3269 transitions. [2023-11-29 07:08:27,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1057 transitions, 2188 flow [2023-11-29 07:08:27,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1057 transitions, 2184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:27,810 INFO L231 Difference]: Finished difference. Result has 1022 places, 1055 transitions, 2126 flow [2023-11-29 07:08:27,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1022, PETRI_TRANSITIONS=1055} [2023-11-29 07:08:27,812 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -35 predicate places. [2023-11-29 07:08:27,812 INFO L495 AbstractCegarLoop]: Abstraction has has 1022 places, 1055 transitions, 2126 flow [2023-11-29 07:08:27,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states 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 07:08:27,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:27,812 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 07:08:27,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 07:08:27,813 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:27,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1539547486, now seen corresponding path program 1 times [2023-11-29 07:08:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113443902] [2023-11-29 07:08:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:08:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:27,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113443902] [2023-11-29 07:08:27,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113443902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:27,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:27,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318721995] [2023-11-29 07:08:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:27,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:27,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:27,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:27,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1133 [2023-11-29 07:08:27,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1055 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states 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 07:08:27,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:27,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1133 [2023-11-29 07:08:27,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:31,749 INFO L124 PetriNetUnfolderBase]: 859/10619 cut-off events. [2023-11-29 07:08:31,749 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 07:08:31,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11425 conditions, 10619 events. 859/10619 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 101923 event pairs, 190 based on Foata normal form. 0/8537 useless extension candidates. Maximal degree in co-relation 10950. Up to 660 conditions per place. [2023-11-29 07:08:32,107 INFO L140 encePairwiseOnDemand]: 1121/1133 looper letters, 29 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2023-11-29 07:08:32,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1014 places, 1049 transitions, 2178 flow [2023-11-29 07:08:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3269 transitions. [2023-11-29 07:08:32,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.961753456899088 [2023-11-29 07:08:32,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3269 transitions. [2023-11-29 07:08:32,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3269 transitions. [2023-11-29 07:08:32,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:32,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3269 transitions. [2023-11-29 07:08:32,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1089.6666666666667) internal successors, (3269), 3 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states 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 07:08:32,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:32,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:32,116 INFO L175 Difference]: Start difference. First operand has 1022 places, 1055 transitions, 2126 flow. Second operand 3 states and 3269 transitions. [2023-11-29 07:08:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1014 places, 1049 transitions, 2178 flow [2023-11-29 07:08:32,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1049 transitions, 2178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:08:32,128 INFO L231 Difference]: Finished difference. Result has 1015 places, 1047 transitions, 2120 flow [2023-11-29 07:08:32,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1043, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1015, PETRI_TRANSITIONS=1047} [2023-11-29 07:08:32,130 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -42 predicate places. [2023-11-29 07:08:32,130 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1047 transitions, 2120 flow [2023-11-29 07:08:32,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states 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 07:08:32,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:32,131 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 07:08:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 07:08:32,131 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:32,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1447206484, now seen corresponding path program 1 times [2023-11-29 07:08:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534494137] [2023-11-29 07:08:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:32,190 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 07:08:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534494137] [2023-11-29 07:08:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534494137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631003934] [2023-11-29 07:08:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:32,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:08:32,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1047 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states 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 07:08:32,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:32,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:08:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:33,360 INFO L124 PetriNetUnfolderBase]: 167/2904 cut-off events. [2023-11-29 07:08:33,360 INFO L125 PetriNetUnfolderBase]: For 18/45 co-relation queries the response was YES. [2023-11-29 07:08:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2904 events. 167/2904 cut-off events. For 18/45 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20879 event pairs, 26 based on Foata normal form. 0/2369 useless extension candidates. Maximal degree in co-relation 2340. Up to 106 conditions per place. [2023-11-29 07:08:33,449 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 22 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2023-11-29 07:08:33,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1048 transitions, 2172 flow [2023-11-29 07:08:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3295 transitions. [2023-11-29 07:08:33,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9694027655192704 [2023-11-29 07:08:33,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3295 transitions. [2023-11-29 07:08:33,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3295 transitions. [2023-11-29 07:08:33,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:33,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3295 transitions. [2023-11-29 07:08:33,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:33,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:33,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:33,457 INFO L175 Difference]: Start difference. First operand has 1015 places, 1047 transitions, 2120 flow. Second operand 3 states and 3295 transitions. [2023-11-29 07:08:33,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1048 transitions, 2172 flow [2023-11-29 07:08:33,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1048 transitions, 2172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:08:33,468 INFO L231 Difference]: Finished difference. Result has 1016 places, 1046 transitions, 2122 flow [2023-11-29 07:08:33,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1016, PETRI_TRANSITIONS=1046} [2023-11-29 07:08:33,469 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -41 predicate places. [2023-11-29 07:08:33,470 INFO L495 AbstractCegarLoop]: Abstraction has has 1016 places, 1046 transitions, 2122 flow [2023-11-29 07:08:33,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states 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 07:08:33,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:33,470 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] [2023-11-29 07:08:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 07:08:33,470 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:33,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1252084144, now seen corresponding path program 1 times [2023-11-29 07:08:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296501303] [2023-11-29 07:08:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:33,513 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 07:08:33,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:33,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296501303] [2023-11-29 07:08:33,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296501303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:33,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:33,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:33,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635832657] [2023-11-29 07:08:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:33,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:33,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1096 out of 1133 [2023-11-29 07:08:33,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1046 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:33,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:33,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1096 of 1133 [2023-11-29 07:08:33,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:34,275 INFO L124 PetriNetUnfolderBase]: 106/2093 cut-off events. [2023-11-29 07:08:34,276 INFO L125 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2023-11-29 07:08:34,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 2093 events. 106/2093 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11815 event pairs, 14 based on Foata normal form. 0/1716 useless extension candidates. Maximal degree in co-relation 1947. Up to 48 conditions per place. [2023-11-29 07:08:34,358 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 16 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2023-11-29 07:08:34,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1047 transitions, 2162 flow [2023-11-29 07:08:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3307 transitions. [2023-11-29 07:08:34,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9729332156516622 [2023-11-29 07:08:34,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3307 transitions. [2023-11-29 07:08:34,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3307 transitions. [2023-11-29 07:08:34,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:34,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3307 transitions. [2023-11-29 07:08:34,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1102.3333333333333) internal successors, (3307), 3 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states 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 07:08:34,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:34,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:34,367 INFO L175 Difference]: Start difference. First operand has 1016 places, 1046 transitions, 2122 flow. Second operand 3 states and 3307 transitions. [2023-11-29 07:08:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1047 transitions, 2162 flow [2023-11-29 07:08:34,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1047 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:34,381 INFO L231 Difference]: Finished difference. Result has 1015 places, 1045 transitions, 2120 flow [2023-11-29 07:08:34,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1043, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1015, PETRI_TRANSITIONS=1045} [2023-11-29 07:08:34,383 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -42 predicate places. [2023-11-29 07:08:34,383 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1045 transitions, 2120 flow [2023-11-29 07:08:34,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:34,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:34,384 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 07:08:34,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 07:08:34,384 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:34,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1294063362, now seen corresponding path program 1 times [2023-11-29 07:08:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539323852] [2023-11-29 07:08:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:34,432 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 07:08:34,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:34,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539323852] [2023-11-29 07:08:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539323852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:34,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86540384] [2023-11-29 07:08:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:34,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:34,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1087 out of 1133 [2023-11-29 07:08:34,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1045 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1088.3333333333333) internal successors, (3265), 3 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states 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 07:08:34,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:34,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1087 of 1133 [2023-11-29 07:08:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:35,777 INFO L124 PetriNetUnfolderBase]: 192/3808 cut-off events. [2023-11-29 07:08:35,778 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2023-11-29 07:08:35,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 3808 events. 192/3808 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26136 event pairs, 8 based on Foata normal form. 0/3110 useless extension candidates. Maximal degree in co-relation 3474. Up to 42 conditions per place. [2023-11-29 07:08:35,928 INFO L140 encePairwiseOnDemand]: 1119/1133 looper letters, 18 selfloop transitions, 9 changer transitions 0/1046 dead transitions. [2023-11-29 07:08:35,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1046 transitions, 2178 flow [2023-11-29 07:08:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3293 transitions. [2023-11-29 07:08:35,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9688143571638718 [2023-11-29 07:08:35,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3293 transitions. [2023-11-29 07:08:35,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3293 transitions. [2023-11-29 07:08:35,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:35,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3293 transitions. [2023-11-29 07:08:35,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states 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 07:08:35,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:35,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:35,937 INFO L175 Difference]: Start difference. First operand has 1015 places, 1045 transitions, 2120 flow. Second operand 3 states and 3293 transitions. [2023-11-29 07:08:35,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1046 transitions, 2178 flow [2023-11-29 07:08:35,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1046 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:35,950 INFO L231 Difference]: Finished difference. Result has 1011 places, 1044 transitions, 2149 flow [2023-11-29 07:08:35,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1031, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2149, PETRI_PLACES=1011, PETRI_TRANSITIONS=1044} [2023-11-29 07:08:35,952 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -46 predicate places. [2023-11-29 07:08:35,952 INFO L495 AbstractCegarLoop]: Abstraction has has 1011 places, 1044 transitions, 2149 flow [2023-11-29 07:08:35,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1088.3333333333333) internal successors, (3265), 3 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states 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 07:08:35,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:35,953 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] [2023-11-29 07:08:35,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 07:08:35,953 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:35,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -155603715, now seen corresponding path program 1 times [2023-11-29 07:08:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218972083] [2023-11-29 07:08:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:36,086 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 07:08:36,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:36,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218972083] [2023-11-29 07:08:36,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218972083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:36,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201279461] [2023-11-29 07:08:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:36,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:08:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:08:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:08:36,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1133 [2023-11-29 07:08:36,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1044 transitions, 2149 flow. Second operand has 5 states, 5 states have (on average 1100.2) internal successors, (5501), 5 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states 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 07:08:36,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:36,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1133 [2023-11-29 07:08:36,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:36,723 INFO L124 PetriNetUnfolderBase]: 64/1570 cut-off events. [2023-11-29 07:08:36,724 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 07:08:36,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 1570 events. 64/1570 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7659 event pairs, 0 based on Foata normal form. 1/1314 useless extension candidates. Maximal degree in co-relation 1538. Up to 9 conditions per place. [2023-11-29 07:08:36,792 INFO L140 encePairwiseOnDemand]: 1126/1133 looper letters, 10 selfloop transitions, 6 changer transitions 0/1045 dead transitions. [2023-11-29 07:08:36,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1015 places, 1045 transitions, 2183 flow [2023-11-29 07:08:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:08:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 07:08:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5507 transitions. [2023-11-29 07:08:36,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9721094439541041 [2023-11-29 07:08:36,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5507 transitions. [2023-11-29 07:08:36,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5507 transitions. [2023-11-29 07:08:36,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:36,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5507 transitions. [2023-11-29 07:08:36,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1101.4) internal successors, (5507), 5 states have internal predecessors, (5507), 0 states have call successors, (0), 0 states 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 07:08:36,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1133.0) internal successors, (6798), 6 states have internal predecessors, (6798), 0 states have call successors, (0), 0 states 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 07:08:36,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1133.0) internal successors, (6798), 6 states have internal predecessors, (6798), 0 states have call successors, (0), 0 states 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 07:08:36,805 INFO L175 Difference]: Start difference. First operand has 1011 places, 1044 transitions, 2149 flow. Second operand 5 states and 5507 transitions. [2023-11-29 07:08:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1015 places, 1045 transitions, 2183 flow [2023-11-29 07:08:36,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1045 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:08:36,818 INFO L231 Difference]: Finished difference. Result has 1015 places, 1045 transitions, 2160 flow [2023-11-29 07:08:36,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2160, PETRI_PLACES=1015, PETRI_TRANSITIONS=1045} [2023-11-29 07:08:36,819 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -42 predicate places. [2023-11-29 07:08:36,820 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1045 transitions, 2160 flow [2023-11-29 07:08:36,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1100.2) internal successors, (5501), 5 states have internal predecessors, (5501), 0 states have call successors, (0), 0 states 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 07:08:36,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:36,820 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] [2023-11-29 07:08:36,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 07:08:36,821 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:36,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -541387049, now seen corresponding path program 1 times [2023-11-29 07:08:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326513650] [2023-11-29 07:08:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:08:37,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326513650] [2023-11-29 07:08:37,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326513650] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156081248] [2023-11-29 07:08:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:37,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:08:37,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:08:37,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:08:37,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:08:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:37,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:08:37,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:08:37,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:08:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156081248] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:08:37,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:08:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 07:08:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380068305] [2023-11-29 07:08:37,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:08:37,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 07:08:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:37,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 07:08:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-29 07:08:37,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1095 out of 1133 [2023-11-29 07:08:37,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1045 transitions, 2160 flow. Second operand has 14 states, 14 states have (on average 1097.142857142857) internal successors, (15360), 14 states have internal predecessors, (15360), 0 states have call successors, (0), 0 states 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 07:08:37,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:37,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1095 of 1133 [2023-11-29 07:08:37,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:38,384 INFO L124 PetriNetUnfolderBase]: 64/1587 cut-off events. [2023-11-29 07:08:38,384 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-29 07:08:38,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1587 events. 64/1587 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7644 event pairs, 0 based on Foata normal form. 2/1332 useless extension candidates. Maximal degree in co-relation 1412. Up to 9 conditions per place. [2023-11-29 07:08:38,451 INFO L140 encePairwiseOnDemand]: 1123/1133 looper letters, 14 selfloop transitions, 13 changer transitions 0/1053 dead transitions. [2023-11-29 07:08:38,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1053 transitions, 2232 flow [2023-11-29 07:08:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:08:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 07:08:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12074 transitions. [2023-11-29 07:08:38,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9687876113295354 [2023-11-29 07:08:38,460 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 12074 transitions. [2023-11-29 07:08:38,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12074 transitions. [2023-11-29 07:08:38,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:38,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 12074 transitions. [2023-11-29 07:08:38,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 1097.6363636363637) internal successors, (12074), 11 states have internal predecessors, (12074), 0 states have call successors, (0), 0 states 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 07:08:38,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1133.0) internal successors, (13596), 12 states have internal predecessors, (13596), 0 states have call successors, (0), 0 states 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 07:08:38,476 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1133.0) internal successors, (13596), 12 states have internal predecessors, (13596), 0 states have call successors, (0), 0 states 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 07:08:38,476 INFO L175 Difference]: Start difference. First operand has 1015 places, 1045 transitions, 2160 flow. Second operand 11 states and 12074 transitions. [2023-11-29 07:08:38,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1053 transitions, 2232 flow [2023-11-29 07:08:38,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2222 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 07:08:38,490 INFO L231 Difference]: Finished difference. Result has 1025 places, 1051 transitions, 2210 flow [2023-11-29 07:08:38,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2210, PETRI_PLACES=1025, PETRI_TRANSITIONS=1051} [2023-11-29 07:08:38,492 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -32 predicate places. [2023-11-29 07:08:38,492 INFO L495 AbstractCegarLoop]: Abstraction has has 1025 places, 1051 transitions, 2210 flow [2023-11-29 07:08:38,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1097.142857142857) internal successors, (15360), 14 states have internal predecessors, (15360), 0 states have call successors, (0), 0 states 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 07:08:38,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:38,495 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:38,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:08:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f26d675-043d-49ae-8bac-18a88ebc3480/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 07:08:38,696 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:38,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -663769577, now seen corresponding path program 2 times [2023-11-29 07:08:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004611691] [2023-11-29 07:08:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004611691] [2023-11-29 07:08:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004611691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:39,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:08:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915904310] [2023-11-29 07:08:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:39,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:08:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:08:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:08:39,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1133 [2023-11-29 07:08:39,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1051 transitions, 2210 flow. Second operand has 6 states, 6 states have (on average 1095.3333333333333) internal successors, (6572), 6 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states 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 07:08:39,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:39,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1133 [2023-11-29 07:08:39,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:40,478 INFO L124 PetriNetUnfolderBase]: 64/1586 cut-off events. [2023-11-29 07:08:40,478 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2023-11-29 07:08:40,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1586 events. 64/1586 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7626 event pairs, 0 based on Foata normal form. 4/1334 useless extension candidates. Maximal degree in co-relation 1414. Up to 18 conditions per place. [2023-11-29 07:08:40,546 INFO L140 encePairwiseOnDemand]: 1128/1133 looper letters, 13 selfloop transitions, 4 changer transitions 0/1050 dead transitions. [2023-11-29 07:08:40,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1050 transitions, 2242 flow [2023-11-29 07:08:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:08:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 07:08:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6576 transitions. [2023-11-29 07:08:40,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673433362753752 [2023-11-29 07:08:40,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 6576 transitions. [2023-11-29 07:08:40,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6576 transitions. [2023-11-29 07:08:40,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:40,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 6576 transitions. [2023-11-29 07:08:40,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 1096.0) internal successors, (6576), 6 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states 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 07:08:40,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1133.0) internal successors, (7931), 7 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states 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 07:08:40,567 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1133.0) internal successors, (7931), 7 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states 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 07:08:40,568 INFO L175 Difference]: Start difference. First operand has 1025 places, 1051 transitions, 2210 flow. Second operand 6 states and 6576 transitions. [2023-11-29 07:08:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1050 transitions, 2242 flow [2023-11-29 07:08:40,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1050 transitions, 2230 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-29 07:08:40,590 INFO L231 Difference]: Finished difference. Result has 1026 places, 1050 transitions, 2204 flow [2023-11-29 07:08:40,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2204, PETRI_PLACES=1026, PETRI_TRANSITIONS=1050} [2023-11-29 07:08:40,592 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -31 predicate places. [2023-11-29 07:08:40,593 INFO L495 AbstractCegarLoop]: Abstraction has has 1026 places, 1050 transitions, 2204 flow [2023-11-29 07:08:40,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1095.3333333333333) internal successors, (6572), 6 states have internal predecessors, (6572), 0 states have call successors, (0), 0 states 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 07:08:40,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:40,595 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:40,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 07:08:40,595 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:40,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1703408187, now seen corresponding path program 1 times [2023-11-29 07:08:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:40,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616440445] [2023-11-29 07:08:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:40,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616440445] [2023-11-29 07:08:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616440445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680717629] [2023-11-29 07:08:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:40,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:40,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1133 [2023-11-29 07:08:40,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1050 transitions, 2204 flow. Second operand has 3 states, 3 states have (on average 1077.6666666666667) internal successors, (3233), 3 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states 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 07:08:40,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:40,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1133 [2023-11-29 07:08:40,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:47,230 INFO L124 PetriNetUnfolderBase]: 1569/19943 cut-off events. [2023-11-29 07:08:47,230 INFO L125 PetriNetUnfolderBase]: For 146/152 co-relation queries the response was YES. [2023-11-29 07:08:47,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21217 conditions, 19943 events. 1569/19943 cut-off events. For 146/152 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 223411 event pairs, 370 based on Foata normal form. 0/16082 useless extension candidates. Maximal degree in co-relation 20969. Up to 1183 conditions per place. [2023-11-29 07:08:47,906 INFO L140 encePairwiseOnDemand]: 1121/1133 looper letters, 29 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2023-11-29 07:08:47,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1044 transitions, 2256 flow [2023-11-29 07:08:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3269 transitions. [2023-11-29 07:08:47,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.961753456899088 [2023-11-29 07:08:47,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3269 transitions. [2023-11-29 07:08:47,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3269 transitions. [2023-11-29 07:08:47,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:47,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3269 transitions. [2023-11-29 07:08:47,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1089.6666666666667) internal successors, (3269), 3 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states 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 07:08:47,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:47,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:47,915 INFO L175 Difference]: Start difference. First operand has 1026 places, 1050 transitions, 2204 flow. Second operand 3 states and 3269 transitions. [2023-11-29 07:08:47,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1044 transitions, 2256 flow [2023-11-29 07:08:47,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1044 transitions, 2249 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 07:08:47,931 INFO L231 Difference]: Finished difference. Result has 1015 places, 1042 transitions, 2191 flow [2023-11-29 07:08:47,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=1015, PETRI_TRANSITIONS=1042} [2023-11-29 07:08:47,933 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -42 predicate places. [2023-11-29 07:08:47,933 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1042 transitions, 2191 flow [2023-11-29 07:08:47,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.6666666666667) internal successors, (3233), 3 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states 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 07:08:47,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:47,934 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:47,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 07:08:47,934 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:47,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1584487915, now seen corresponding path program 1 times [2023-11-29 07:08:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313128862] [2023-11-29 07:08:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313128862] [2023-11-29 07:08:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313128862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:48,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:48,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865609611] [2023-11-29 07:08:48,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:48,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:48,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:48,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:48,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1133 [2023-11-29 07:08:48,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1042 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 1094.6666666666667) internal successors, (3284), 3 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states 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 07:08:48,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:48,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1133 [2023-11-29 07:08:48,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:49,588 INFO L124 PetriNetUnfolderBase]: 262/5155 cut-off events. [2023-11-29 07:08:49,588 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 07:08:49,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5387 conditions, 5155 events. 262/5155 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 44574 event pairs, 20 based on Foata normal form. 0/4263 useless extension candidates. Maximal degree in co-relation 5139. Up to 68 conditions per place. [2023-11-29 07:08:49,757 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 22 selfloop transitions, 3 changer transitions 0/1043 dead transitions. [2023-11-29 07:08:49,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1043 transitions, 2245 flow [2023-11-29 07:08:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3301 transitions. [2023-11-29 07:08:49,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9711679905854663 [2023-11-29 07:08:49,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3301 transitions. [2023-11-29 07:08:49,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3301 transitions. [2023-11-29 07:08:49,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:49,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3301 transitions. [2023-11-29 07:08:49,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states 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 07:08:49,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:49,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:49,765 INFO L175 Difference]: Start difference. First operand has 1015 places, 1042 transitions, 2191 flow. Second operand 3 states and 3301 transitions. [2023-11-29 07:08:49,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1043 transitions, 2245 flow [2023-11-29 07:08:49,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1043 transitions, 2245 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:08:49,777 INFO L231 Difference]: Finished difference. Result has 1016 places, 1041 transitions, 2195 flow [2023-11-29 07:08:49,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2189, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2195, PETRI_PLACES=1016, PETRI_TRANSITIONS=1041} [2023-11-29 07:08:49,778 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -41 predicate places. [2023-11-29 07:08:49,778 INFO L495 AbstractCegarLoop]: Abstraction has has 1016 places, 1041 transitions, 2195 flow [2023-11-29 07:08:49,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1094.6666666666667) internal successors, (3284), 3 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states 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 07:08:49,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:49,779 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:49,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 07:08:49,780 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:49,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -333079936, now seen corresponding path program 1 times [2023-11-29 07:08:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964316734] [2023-11-29 07:08:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964316734] [2023-11-29 07:08:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964316734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:49,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246809496] [2023-11-29 07:08:49,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:49,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:49,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:08:49,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1041 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:08:49,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:49,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:08:49,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:51,005 INFO L124 PetriNetUnfolderBase]: 181/3097 cut-off events. [2023-11-29 07:08:51,005 INFO L125 PetriNetUnfolderBase]: For 50/52 co-relation queries the response was YES. [2023-11-29 07:08:51,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 3097 events. 181/3097 cut-off events. For 50/52 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22332 event pairs, 37 based on Foata normal form. 0/2574 useless extension candidates. Maximal degree in co-relation 3084. Up to 139 conditions per place. [2023-11-29 07:08:51,113 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 22 selfloop transitions, 2 changer transitions 0/1042 dead transitions. [2023-11-29 07:08:51,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1042 transitions, 2247 flow [2023-11-29 07:08:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3295 transitions. [2023-11-29 07:08:51,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9694027655192704 [2023-11-29 07:08:51,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3295 transitions. [2023-11-29 07:08:51,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3295 transitions. [2023-11-29 07:08:51,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:51,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3295 transitions. [2023-11-29 07:08:51,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:08:51,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:51,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:51,122 INFO L175 Difference]: Start difference. First operand has 1016 places, 1041 transitions, 2195 flow. Second operand 3 states and 3295 transitions. [2023-11-29 07:08:51,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1042 transitions, 2247 flow [2023-11-29 07:08:51,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1042 transitions, 2241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:51,135 INFO L231 Difference]: Finished difference. Result has 1015 places, 1040 transitions, 2191 flow [2023-11-29 07:08:51,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2191, PETRI_PLACES=1015, PETRI_TRANSITIONS=1040} [2023-11-29 07:08:51,136 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -42 predicate places. [2023-11-29 07:08:51,137 INFO L495 AbstractCegarLoop]: Abstraction has has 1015 places, 1040 transitions, 2191 flow [2023-11-29 07:08:51,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:08:51,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:51,137 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:51,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 07:08:51,138 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:51,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:51,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1197505941, now seen corresponding path program 1 times [2023-11-29 07:08:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267273866] [2023-11-29 07:08:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267273866] [2023-11-29 07:08:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267273866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192226274] [2023-11-29 07:08:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:51,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:51,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1087 out of 1133 [2023-11-29 07:08:51,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1040 transitions, 2191 flow. Second operand has 3 states, 3 states have (on average 1088.6666666666667) internal successors, (3266), 3 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states 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 07:08:51,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:51,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1087 of 1133 [2023-11-29 07:08:51,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:52,995 INFO L124 PetriNetUnfolderBase]: 298/5608 cut-off events. [2023-11-29 07:08:52,996 INFO L125 PetriNetUnfolderBase]: For 19/33 co-relation queries the response was YES. [2023-11-29 07:08:53,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 5608 events. 298/5608 cut-off events. For 19/33 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 46011 event pairs, 12 based on Foata normal form. 0/4654 useless extension candidates. Maximal degree in co-relation 5644. Up to 66 conditions per place. [2023-11-29 07:08:53,189 INFO L140 encePairwiseOnDemand]: 1119/1133 looper letters, 18 selfloop transitions, 9 changer transitions 0/1041 dead transitions. [2023-11-29 07:08:53,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1041 transitions, 2249 flow [2023-11-29 07:08:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3293 transitions. [2023-11-29 07:08:53,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9688143571638718 [2023-11-29 07:08:53,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3293 transitions. [2023-11-29 07:08:53,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3293 transitions. [2023-11-29 07:08:53,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:53,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3293 transitions. [2023-11-29 07:08:53,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.6666666666667) internal successors, (3293), 3 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states 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 07:08:53,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:53,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:53,198 INFO L175 Difference]: Start difference. First operand has 1015 places, 1040 transitions, 2191 flow. Second operand 3 states and 3293 transitions. [2023-11-29 07:08:53,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1041 transitions, 2249 flow [2023-11-29 07:08:53,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1041 transitions, 2245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:53,211 INFO L231 Difference]: Finished difference. Result has 1011 places, 1039 transitions, 2220 flow [2023-11-29 07:08:53,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1035, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2220, PETRI_PLACES=1011, PETRI_TRANSITIONS=1039} [2023-11-29 07:08:53,212 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -46 predicate places. [2023-11-29 07:08:53,212 INFO L495 AbstractCegarLoop]: Abstraction has has 1011 places, 1039 transitions, 2220 flow [2023-11-29 07:08:53,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1088.6666666666667) internal successors, (3266), 3 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states 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 07:08:53,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:53,213 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 07:08:53,214 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:53,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 874330722, now seen corresponding path program 1 times [2023-11-29 07:08:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982578090] [2023-11-29 07:08:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982578090] [2023-11-29 07:08:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982578090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879517790] [2023-11-29 07:08:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:53,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:53,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1133 [2023-11-29 07:08:53,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1039 transitions, 2220 flow. Second operand has 3 states, 3 states have (on average 1095.0) internal successors, (3285), 3 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states 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 07:08:53,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:53,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1133 [2023-11-29 07:08:53,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:55,107 INFO L124 PetriNetUnfolderBase]: 285/5471 cut-off events. [2023-11-29 07:08:55,107 INFO L125 PetriNetUnfolderBase]: For 118/171 co-relation queries the response was YES. [2023-11-29 07:08:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5809 conditions, 5471 events. 285/5471 cut-off events. For 118/171 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 48588 event pairs, 24 based on Foata normal form. 0/4546 useless extension candidates. Maximal degree in co-relation 5559. Up to 104 conditions per place. [2023-11-29 07:08:55,309 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 22 selfloop transitions, 3 changer transitions 0/1040 dead transitions. [2023-11-29 07:08:55,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1040 transitions, 2274 flow [2023-11-29 07:08:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3301 transitions. [2023-11-29 07:08:55,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9711679905854663 [2023-11-29 07:08:55,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3301 transitions. [2023-11-29 07:08:55,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3301 transitions. [2023-11-29 07:08:55,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:55,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3301 transitions. [2023-11-29 07:08:55,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1100.3333333333333) internal successors, (3301), 3 states have internal predecessors, (3301), 0 states have call successors, (0), 0 states 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 07:08:55,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:55,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:55,317 INFO L175 Difference]: Start difference. First operand has 1011 places, 1039 transitions, 2220 flow. Second operand 3 states and 3301 transitions. [2023-11-29 07:08:55,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1040 transitions, 2274 flow [2023-11-29 07:08:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1040 transitions, 2265 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:08:55,331 INFO L231 Difference]: Finished difference. Result has 1011 places, 1038 transitions, 2215 flow [2023-11-29 07:08:55,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2215, PETRI_PLACES=1011, PETRI_TRANSITIONS=1038} [2023-11-29 07:08:55,332 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -46 predicate places. [2023-11-29 07:08:55,333 INFO L495 AbstractCegarLoop]: Abstraction has has 1011 places, 1038 transitions, 2215 flow [2023-11-29 07:08:55,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.0) internal successors, (3285), 3 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states 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 07:08:55,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:55,333 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:55,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 07:08:55,334 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:55,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2075620263, now seen corresponding path program 1 times [2023-11-29 07:08:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500701473] [2023-11-29 07:08:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500701473] [2023-11-29 07:08:55,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500701473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:55,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186981055] [2023-11-29 07:08:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:55,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:55,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:55,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1087 out of 1133 [2023-11-29 07:08:55,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1038 transitions, 2215 flow. Second operand has 3 states, 3 states have (on average 1089.0) internal successors, (3267), 3 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states 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 07:08:55,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:55,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1087 of 1133 [2023-11-29 07:08:55,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:56,555 INFO L124 PetriNetUnfolderBase]: 174/3234 cut-off events. [2023-11-29 07:08:56,555 INFO L125 PetriNetUnfolderBase]: For 47/49 co-relation queries the response was YES. [2023-11-29 07:08:56,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3517 conditions, 3234 events. 174/3234 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 22850 event pairs, 21 based on Foata normal form. 2/2741 useless extension candidates. Maximal degree in co-relation 3267. Up to 90 conditions per place. [2023-11-29 07:08:56,674 INFO L140 encePairwiseOnDemand]: 1119/1133 looper letters, 16 selfloop transitions, 8 changer transitions 13/1039 dead transitions. [2023-11-29 07:08:56,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1039 transitions, 2271 flow [2023-11-29 07:08:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3292 transitions. [2023-11-29 07:08:56,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9685201529861724 [2023-11-29 07:08:56,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3292 transitions. [2023-11-29 07:08:56,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3292 transitions. [2023-11-29 07:08:56,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:56,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3292 transitions. [2023-11-29 07:08:56,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1097.3333333333333) internal successors, (3292), 3 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states 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 07:08:56,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:56,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:56,686 INFO L175 Difference]: Start difference. First operand has 1011 places, 1038 transitions, 2215 flow. Second operand 3 states and 3292 transitions. [2023-11-29 07:08:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1008 places, 1039 transitions, 2271 flow [2023-11-29 07:08:56,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1006 places, 1039 transitions, 2265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:08:56,705 INFO L231 Difference]: Finished difference. Result has 1007 places, 1024 transitions, 2208 flow [2023-11-29 07:08:56,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=1004, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2208, PETRI_PLACES=1007, PETRI_TRANSITIONS=1024} [2023-11-29 07:08:56,706 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -50 predicate places. [2023-11-29 07:08:56,707 INFO L495 AbstractCegarLoop]: Abstraction has has 1007 places, 1024 transitions, 2208 flow [2023-11-29 07:08:56,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1089.0) internal successors, (3267), 3 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states 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 07:08:56,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:56,708 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 07:08:56,708 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:56,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -88805472, now seen corresponding path program 1 times [2023-11-29 07:08:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355025929] [2023-11-29 07:08:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355025929] [2023-11-29 07:08:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355025929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:56,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:56,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:08:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293264306] [2023-11-29 07:08:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:56,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1133 [2023-11-29 07:08:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 1024 transitions, 2208 flow. Second operand has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 07:08:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1133 [2023-11-29 07:08:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:08:58,575 INFO L124 PetriNetUnfolderBase]: 215/4689 cut-off events. [2023-11-29 07:08:58,575 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2023-11-29 07:08:58,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 4689 events. 215/4689 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39419 event pairs, 4 based on Foata normal form. 0/3961 useless extension candidates. Maximal degree in co-relation 4795. Up to 73 conditions per place. [2023-11-29 07:08:58,783 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 16 selfloop transitions, 2 changer transitions 0/1029 dead transitions. [2023-11-29 07:08:58,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 1029 transitions, 2258 flow [2023-11-29 07:08:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:08:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:08:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3316 transitions. [2023-11-29 07:08:58,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9755810532509561 [2023-11-29 07:08:58,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3316 transitions. [2023-11-29 07:08:58,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3316 transitions. [2023-11-29 07:08:58,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:08:58,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3316 transitions. [2023-11-29 07:08:58,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.3333333333333) internal successors, (3316), 3 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states 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 07:08:58,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:58,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:08:58,791 INFO L175 Difference]: Start difference. First operand has 1007 places, 1024 transitions, 2208 flow. Second operand 3 states and 3316 transitions. [2023-11-29 07:08:58,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 1029 transitions, 2258 flow [2023-11-29 07:08:58,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 996 places, 1029 transitions, 2250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:08:58,804 INFO L231 Difference]: Finished difference. Result has 998 places, 1025 transitions, 2214 flow [2023-11-29 07:08:58,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=994, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2214, PETRI_PLACES=998, PETRI_TRANSITIONS=1025} [2023-11-29 07:08:58,805 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -59 predicate places. [2023-11-29 07:08:58,805 INFO L495 AbstractCegarLoop]: Abstraction has has 998 places, 1025 transitions, 2214 flow [2023-11-29 07:08:58,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.3333333333333) internal successors, (3304), 3 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 07:08:58,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:08:58,806 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:58,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 07:08:58,806 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:08:58,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1983549566, now seen corresponding path program 1 times [2023-11-29 07:08:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:08:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642852849] [2023-11-29 07:08:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:08:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:08:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:08:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642852849] [2023-11-29 07:08:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642852849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:08:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:08:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:08:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363400494] [2023-11-29 07:08:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:08:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:08:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:08:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:08:58,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1133 [2023-11-29 07:08:58,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 998 places, 1025 transitions, 2214 flow. Second operand has 3 states, 3 states have (on average 1079.6666666666667) internal successors, (3239), 3 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states 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 07:08:58,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:08:58,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1133 [2023-11-29 07:08:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:02,429 INFO L124 PetriNetUnfolderBase]: 488/9125 cut-off events. [2023-11-29 07:09:02,429 INFO L125 PetriNetUnfolderBase]: For 10/46 co-relation queries the response was YES. [2023-11-29 07:09:02,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9948 conditions, 9125 events. 488/9125 cut-off events. For 10/46 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 84128 event pairs, 14 based on Foata normal form. 2/7731 useless extension candidates. Maximal degree in co-relation 9696. Up to 166 conditions per place. [2023-11-29 07:09:02,801 INFO L140 encePairwiseOnDemand]: 1116/1133 looper letters, 23 selfloop transitions, 9 changer transitions 0/1023 dead transitions. [2023-11-29 07:09:02,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 1023 transitions, 2276 flow [2023-11-29 07:09:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3274 transitions. [2023-11-29 07:09:02,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9632244777875846 [2023-11-29 07:09:02,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3274 transitions. [2023-11-29 07:09:02,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3274 transitions. [2023-11-29 07:09:02,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:02,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3274 transitions. [2023-11-29 07:09:02,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:09:02,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:02,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:02,809 INFO L175 Difference]: Start difference. First operand has 998 places, 1025 transitions, 2214 flow. Second operand 3 states and 3274 transitions. [2023-11-29 07:09:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 992 places, 1023 transitions, 2276 flow [2023-11-29 07:09:02,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1023 transitions, 2274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:09:02,823 INFO L231 Difference]: Finished difference. Result has 993 places, 1021 transitions, 2248 flow [2023-11-29 07:09:02,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2248, PETRI_PLACES=993, PETRI_TRANSITIONS=1021} [2023-11-29 07:09:02,825 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -64 predicate places. [2023-11-29 07:09:02,825 INFO L495 AbstractCegarLoop]: Abstraction has has 993 places, 1021 transitions, 2248 flow [2023-11-29 07:09:02,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1079.6666666666667) internal successors, (3239), 3 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states 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 07:09:02,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:02,825 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:02,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 07:09:02,826 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:02,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 132571556, now seen corresponding path program 1 times [2023-11-29 07:09:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642934073] [2023-11-29 07:09:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642934073] [2023-11-29 07:09:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642934073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782428379] [2023-11-29 07:09:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:02,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1133 [2023-11-29 07:09:02,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1021 transitions, 2248 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:09:02,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:02,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1133 [2023-11-29 07:09:02,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:04,682 INFO L124 PetriNetUnfolderBase]: 259/4269 cut-off events. [2023-11-29 07:09:04,682 INFO L125 PetriNetUnfolderBase]: For 206/210 co-relation queries the response was YES. [2023-11-29 07:09:04,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4822 conditions, 4269 events. 259/4269 cut-off events. For 206/210 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 33928 event pairs, 60 based on Foata normal form. 0/3598 useless extension candidates. Maximal degree in co-relation 4569. Up to 212 conditions per place. [2023-11-29 07:09:04,873 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 20 selfloop transitions, 3 changer transitions 0/1022 dead transitions. [2023-11-29 07:09:04,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 1022 transitions, 2298 flow [2023-11-29 07:09:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3299 transitions. [2023-11-29 07:09:04,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9705795822300677 [2023-11-29 07:09:04,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3299 transitions. [2023-11-29 07:09:04,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3299 transitions. [2023-11-29 07:09:04,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:04,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3299 transitions. [2023-11-29 07:09:04,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1099.6666666666667) internal successors, (3299), 3 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states 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 07:09:04,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:04,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:04,880 INFO L175 Difference]: Start difference. First operand has 993 places, 1021 transitions, 2248 flow. Second operand 3 states and 3299 transitions. [2023-11-29 07:09:04,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 1022 transitions, 2298 flow [2023-11-29 07:09:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 992 places, 1022 transitions, 2280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:04,894 INFO L231 Difference]: Finished difference. Result has 992 places, 1020 transitions, 2234 flow [2023-11-29 07:09:04,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2234, PETRI_PLACES=992, PETRI_TRANSITIONS=1020} [2023-11-29 07:09:04,895 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -65 predicate places. [2023-11-29 07:09:04,895 INFO L495 AbstractCegarLoop]: Abstraction has has 992 places, 1020 transitions, 2234 flow [2023-11-29 07:09:04,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:09:04,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:04,896 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:04,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 07:09:04,896 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:04,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 68986743, now seen corresponding path program 1 times [2023-11-29 07:09:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210106369] [2023-11-29 07:09:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210106369] [2023-11-29 07:09:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210106369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353073242] [2023-11-29 07:09:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:05,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:09:05,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 1020 transitions, 2234 flow. Second operand has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states 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 07:09:05,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:05,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:09:05,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:07,512 INFO L124 PetriNetUnfolderBase]: 367/7113 cut-off events. [2023-11-29 07:09:07,512 INFO L125 PetriNetUnfolderBase]: For 101/139 co-relation queries the response was YES. [2023-11-29 07:09:07,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7859 conditions, 7113 events. 367/7113 cut-off events. For 101/139 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 68515 event pairs, 48 based on Foata normal form. 2/6049 useless extension candidates. Maximal degree in co-relation 7606. Up to 147 conditions per place. [2023-11-29 07:09:07,777 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 24 selfloop transitions, 3 changer transitions 0/1021 dead transitions. [2023-11-29 07:09:07,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1021 transitions, 2292 flow [2023-11-29 07:09:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:09:07,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:09:07,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:09:07,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:09:07,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:07,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:09:07,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:09:07,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:07,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:07,785 INFO L175 Difference]: Start difference. First operand has 992 places, 1020 transitions, 2234 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:09:07,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1021 transitions, 2292 flow [2023-11-29 07:09:07,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1021 transitions, 2286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:07,798 INFO L231 Difference]: Finished difference. Result has 991 places, 1019 transitions, 2232 flow [2023-11-29 07:09:07,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2232, PETRI_PLACES=991, PETRI_TRANSITIONS=1019} [2023-11-29 07:09:07,799 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -66 predicate places. [2023-11-29 07:09:07,799 INFO L495 AbstractCegarLoop]: Abstraction has has 991 places, 1019 transitions, 2232 flow [2023-11-29 07:09:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.0) internal successors, (3276), 3 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states 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 07:09:07,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:07,800 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 07:09:07,800 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:07,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -936075235, now seen corresponding path program 1 times [2023-11-29 07:09:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102301687] [2023-11-29 07:09:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102301687] [2023-11-29 07:09:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102301687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:07,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:09:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251547807] [2023-11-29 07:09:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:07,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:07,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1133 [2023-11-29 07:09:07,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 1019 transitions, 2232 flow. Second operand has 3 states, 3 states have (on average 1101.6666666666667) internal successors, (3305), 3 states have internal predecessors, (3305), 0 states have call successors, (0), 0 states 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 07:09:07,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:07,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1133 [2023-11-29 07:09:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:10,903 INFO L124 PetriNetUnfolderBase]: 267/5821 cut-off events. [2023-11-29 07:09:10,903 INFO L125 PetriNetUnfolderBase]: For 20/76 co-relation queries the response was YES. [2023-11-29 07:09:11,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 5821 events. 267/5821 cut-off events. For 20/76 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 51715 event pairs, 8 based on Foata normal form. 0/4926 useless extension candidates. Maximal degree in co-relation 5995. Up to 89 conditions per place. [2023-11-29 07:09:11,316 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 15 selfloop transitions, 2 changer transitions 0/1023 dead transitions. [2023-11-29 07:09:11,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1023 transitions, 2277 flow [2023-11-29 07:09:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3315 transitions. [2023-11-29 07:09:11,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9752868490732568 [2023-11-29 07:09:11,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3315 transitions. [2023-11-29 07:09:11,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3315 transitions. [2023-11-29 07:09:11,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:11,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3315 transitions. [2023-11-29 07:09:11,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1105.0) internal successors, (3315), 3 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states 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 07:09:11,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:11,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:11,324 INFO L175 Difference]: Start difference. First operand has 991 places, 1019 transitions, 2232 flow. Second operand 3 states and 3315 transitions. [2023-11-29 07:09:11,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1023 transitions, 2277 flow [2023-11-29 07:09:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 1023 transitions, 2271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:11,337 INFO L231 Difference]: Finished difference. Result has 993 places, 1020 transitions, 2240 flow [2023-11-29 07:09:11,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=989, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1017, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2240, PETRI_PLACES=993, PETRI_TRANSITIONS=1020} [2023-11-29 07:09:11,338 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -64 predicate places. [2023-11-29 07:09:11,338 INFO L495 AbstractCegarLoop]: Abstraction has has 993 places, 1020 transitions, 2240 flow [2023-11-29 07:09:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1101.6666666666667) internal successors, (3305), 3 states have internal predecessors, (3305), 0 states have call successors, (0), 0 states 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 07:09:11,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:11,339 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 07:09:11,340 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:11,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash -493864901, now seen corresponding path program 1 times [2023-11-29 07:09:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:11,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778225669] [2023-11-29 07:09:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:11,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778225669] [2023-11-29 07:09:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778225669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:11,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517795050] [2023-11-29 07:09:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:11,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:11,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1133 [2023-11-29 07:09:11,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1020 transitions, 2240 flow. Second operand has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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 07:09:11,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:11,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1133 [2023-11-29 07:09:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:16,952 INFO L124 PetriNetUnfolderBase]: 631/11045 cut-off events. [2023-11-29 07:09:16,953 INFO L125 PetriNetUnfolderBase]: For 88/176 co-relation queries the response was YES. [2023-11-29 07:09:17,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12186 conditions, 11045 events. 631/11045 cut-off events. For 88/176 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 115355 event pairs, 67 based on Foata normal form. 0/9381 useless extension candidates. Maximal degree in co-relation 11932. Up to 336 conditions per place. [2023-11-29 07:09:17,556 INFO L140 encePairwiseOnDemand]: 1116/1133 looper letters, 23 selfloop transitions, 9 changer transitions 0/1018 dead transitions. [2023-11-29 07:09:17,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1018 transitions, 2302 flow [2023-11-29 07:09:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3274 transitions. [2023-11-29 07:09:17,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9632244777875846 [2023-11-29 07:09:17,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3274 transitions. [2023-11-29 07:09:17,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3274 transitions. [2023-11-29 07:09:17,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:17,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3274 transitions. [2023-11-29 07:09:17,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:09:17,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:17,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:17,563 INFO L175 Difference]: Start difference. First operand has 993 places, 1020 transitions, 2240 flow. Second operand 3 states and 3274 transitions. [2023-11-29 07:09:17,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1018 transitions, 2302 flow [2023-11-29 07:09:17,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1018 transitions, 2300 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:09:17,575 INFO L231 Difference]: Finished difference. Result has 988 places, 1016 transitions, 2274 flow [2023-11-29 07:09:17,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1003, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2274, PETRI_PLACES=988, PETRI_TRANSITIONS=1016} [2023-11-29 07:09:17,576 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -69 predicate places. [2023-11-29 07:09:17,576 INFO L495 AbstractCegarLoop]: Abstraction has has 988 places, 1016 transitions, 2274 flow [2023-11-29 07:09:17,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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 07:09:17,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:17,578 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:17,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 07:09:17,578 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:17,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash 578549870, now seen corresponding path program 1 times [2023-11-29 07:09:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804771005] [2023-11-29 07:09:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804771005] [2023-11-29 07:09:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804771005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53801455] [2023-11-29 07:09:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:17,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:17,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:17,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:17,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:09:17,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1016 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:09:17,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:17,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:09:17,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:22,472 INFO L124 PetriNetUnfolderBase]: 484/8855 cut-off events. [2023-11-29 07:09:22,472 INFO L125 PetriNetUnfolderBase]: For 390/537 co-relation queries the response was YES. [2023-11-29 07:09:23,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 8855 events. 484/8855 cut-off events. For 390/537 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 93999 event pairs, 95 based on Foata normal form. 1/7540 useless extension candidates. Maximal degree in co-relation 9732. Up to 284 conditions per place. [2023-11-29 07:09:23,200 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 24 selfloop transitions, 3 changer transitions 0/1017 dead transitions. [2023-11-29 07:09:23,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1017 transitions, 2332 flow [2023-11-29 07:09:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:09:23,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:09:23,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:09:23,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:09:23,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:23,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:09:23,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:09:23,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:23,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:23,209 INFO L175 Difference]: Start difference. First operand has 988 places, 1016 transitions, 2274 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:09:23,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1017 transitions, 2332 flow [2023-11-29 07:09:23,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1017 transitions, 2314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:23,224 INFO L231 Difference]: Finished difference. Result has 987 places, 1015 transitions, 2260 flow [2023-11-29 07:09:23,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=987, PETRI_TRANSITIONS=1015} [2023-11-29 07:09:23,226 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -70 predicate places. [2023-11-29 07:09:23,226 INFO L495 AbstractCegarLoop]: Abstraction has has 987 places, 1015 transitions, 2260 flow [2023-11-29 07:09:23,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.3333333333333) internal successors, (3277), 3 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 07:09:23,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:23,227 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 07:09:23,227 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:23,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1416913576, now seen corresponding path program 1 times [2023-11-29 07:09:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:23,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55505844] [2023-11-29 07:09:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55505844] [2023-11-29 07:09:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55505844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932269360] [2023-11-29 07:09:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:23,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:23,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:23,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1092 out of 1133 [2023-11-29 07:09:23,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1015 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 1093.6666666666667) internal successors, (3281), 3 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states 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 07:09:23,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:23,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1092 of 1133 [2023-11-29 07:09:23,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:25,906 INFO L124 PetriNetUnfolderBase]: 263/5309 cut-off events. [2023-11-29 07:09:25,906 INFO L125 PetriNetUnfolderBase]: For 16/34 co-relation queries the response was YES. [2023-11-29 07:09:26,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 5309 events. 263/5309 cut-off events. For 16/34 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 48666 event pairs, 6 based on Foata normal form. 1/4611 useless extension candidates. Maximal degree in co-relation 5716. Up to 106 conditions per place. [2023-11-29 07:09:26,218 INFO L140 encePairwiseOnDemand]: 1126/1133 looper letters, 15 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2023-11-29 07:09:26,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1013 transitions, 2294 flow [2023-11-29 07:09:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3298 transitions. [2023-11-29 07:09:26,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9702853780523684 [2023-11-29 07:09:26,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3298 transitions. [2023-11-29 07:09:26,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3298 transitions. [2023-11-29 07:09:26,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:26,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3298 transitions. [2023-11-29 07:09:26,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1099.3333333333333) internal successors, (3298), 3 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states 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 07:09:26,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:26,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:26,225 INFO L175 Difference]: Start difference. First operand has 987 places, 1015 transitions, 2260 flow. Second operand 3 states and 3298 transitions. [2023-11-29 07:09:26,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1013 transitions, 2294 flow [2023-11-29 07:09:26,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1013 transitions, 2288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:26,240 INFO L231 Difference]: Finished difference. Result has 983 places, 1011 transitions, 2252 flow [2023-11-29 07:09:26,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2252, PETRI_PLACES=983, PETRI_TRANSITIONS=1011} [2023-11-29 07:09:26,241 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -74 predicate places. [2023-11-29 07:09:26,242 INFO L495 AbstractCegarLoop]: Abstraction has has 983 places, 1011 transitions, 2252 flow [2023-11-29 07:09:26,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1093.6666666666667) internal successors, (3281), 3 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states 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 07:09:26,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:26,242 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:26,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 07:09:26,242 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:26,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -776570321, now seen corresponding path program 1 times [2023-11-29 07:09:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716860335] [2023-11-29 07:09:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716860335] [2023-11-29 07:09:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716860335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:26,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:09:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455028447] [2023-11-29 07:09:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:26,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1099 out of 1133 [2023-11-29 07:09:26,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1011 transitions, 2252 flow. Second operand has 3 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states 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 07:09:26,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:26,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1099 of 1133 [2023-11-29 07:09:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:30,758 INFO L124 PetriNetUnfolderBase]: 386/8478 cut-off events. [2023-11-29 07:09:30,759 INFO L125 PetriNetUnfolderBase]: For 42/46 co-relation queries the response was YES. [2023-11-29 07:09:31,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9098 conditions, 8478 events. 386/8478 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 76629 event pairs, 24 based on Foata normal form. 0/7140 useless extension candidates. Maximal degree in co-relation 8840. Up to 175 conditions per place. [2023-11-29 07:09:31,394 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 14 selfloop transitions, 2 changer transitions 0/1014 dead transitions. [2023-11-29 07:09:31,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1014 transitions, 2292 flow [2023-11-29 07:09:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3314 transitions. [2023-11-29 07:09:31,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9749926448955575 [2023-11-29 07:09:31,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3314 transitions. [2023-11-29 07:09:31,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3314 transitions. [2023-11-29 07:09:31,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:31,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3314 transitions. [2023-11-29 07:09:31,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.6666666666667) internal successors, (3314), 3 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states 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 07:09:31,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:31,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:31,402 INFO L175 Difference]: Start difference. First operand has 983 places, 1011 transitions, 2252 flow. Second operand 3 states and 3314 transitions. [2023-11-29 07:09:31,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1014 transitions, 2292 flow [2023-11-29 07:09:31,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1014 transitions, 2286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:31,416 INFO L231 Difference]: Finished difference. Result has 985 places, 1012 transitions, 2260 flow [2023-11-29 07:09:31,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2260, PETRI_PLACES=985, PETRI_TRANSITIONS=1012} [2023-11-29 07:09:31,417 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -72 predicate places. [2023-11-29 07:09:31,418 INFO L495 AbstractCegarLoop]: Abstraction has has 985 places, 1012 transitions, 2260 flow [2023-11-29 07:09:31,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1102.0) internal successors, (3306), 3 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states 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 07:09:31,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:31,418 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:31,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 07:09:31,419 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:31,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1828456371, now seen corresponding path program 1 times [2023-11-29 07:09:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778114377] [2023-11-29 07:09:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778114377] [2023-11-29 07:09:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778114377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634843558] [2023-11-29 07:09:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:31,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:31,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1133 [2023-11-29 07:09:31,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 985 places, 1012 transitions, 2260 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states 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 07:09:31,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:31,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1133 [2023-11-29 07:09:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:36,530 INFO L124 PetriNetUnfolderBase]: 702/10437 cut-off events. [2023-11-29 07:09:36,530 INFO L125 PetriNetUnfolderBase]: For 330/334 co-relation queries the response was YES. [2023-11-29 07:09:37,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11981 conditions, 10437 events. 702/10437 cut-off events. For 330/334 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 115815 event pairs, 54 based on Foata normal form. 0/8914 useless extension candidates. Maximal degree in co-relation 11725. Up to 682 conditions per place. [2023-11-29 07:09:37,213 INFO L140 encePairwiseOnDemand]: 1116/1133 looper letters, 23 selfloop transitions, 9 changer transitions 0/1010 dead transitions. [2023-11-29 07:09:37,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1010 transitions, 2322 flow [2023-11-29 07:09:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3274 transitions. [2023-11-29 07:09:37,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9632244777875846 [2023-11-29 07:09:37,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3274 transitions. [2023-11-29 07:09:37,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3274 transitions. [2023-11-29 07:09:37,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:37,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3274 transitions. [2023-11-29 07:09:37,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1091.3333333333333) internal successors, (3274), 3 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states 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 07:09:37,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:37,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:37,222 INFO L175 Difference]: Start difference. First operand has 985 places, 1012 transitions, 2260 flow. Second operand 3 states and 3274 transitions. [2023-11-29 07:09:37,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1010 transitions, 2322 flow [2023-11-29 07:09:37,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1010 transitions, 2320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 07:09:37,235 INFO L231 Difference]: Finished difference. Result has 980 places, 1008 transitions, 2294 flow [2023-11-29 07:09:37,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2242, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=980, PETRI_TRANSITIONS=1008} [2023-11-29 07:09:37,237 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -77 predicate places. [2023-11-29 07:09:37,237 INFO L495 AbstractCegarLoop]: Abstraction has has 980 places, 1008 transitions, 2294 flow [2023-11-29 07:09:37,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states 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 07:09:37,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:37,237 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:37,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 07:09:37,238 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:37,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2139079760, now seen corresponding path program 1 times [2023-11-29 07:09:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859168028] [2023-11-29 07:09:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859168028] [2023-11-29 07:09:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859168028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068520666] [2023-11-29 07:09:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:37,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:37,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:37,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:37,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1090 out of 1133 [2023-11-29 07:09:37,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 980 places, 1008 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 1092.6666666666667) internal successors, (3278), 3 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states 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 07:09:37,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:37,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1090 of 1133 [2023-11-29 07:09:37,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:42,873 INFO L124 PetriNetUnfolderBase]: 558/8955 cut-off events. [2023-11-29 07:09:42,873 INFO L125 PetriNetUnfolderBase]: For 908/912 co-relation queries the response was YES. [2023-11-29 07:09:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10722 conditions, 8955 events. 558/8955 cut-off events. For 908/912 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 96865 event pairs, 118 based on Foata normal form. 0/7712 useless extension candidates. Maximal degree in co-relation 10465. Up to 585 conditions per place. [2023-11-29 07:09:43,346 INFO L140 encePairwiseOnDemand]: 1130/1133 looper letters, 24 selfloop transitions, 3 changer transitions 0/1009 dead transitions. [2023-11-29 07:09:43,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 981 places, 1009 transitions, 2352 flow [2023-11-29 07:09:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3294 transitions. [2023-11-29 07:09:43,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9691085613415711 [2023-11-29 07:09:43,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3294 transitions. [2023-11-29 07:09:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3294 transitions. [2023-11-29 07:09:43,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:43,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3294 transitions. [2023-11-29 07:09:43,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1098.0) internal successors, (3294), 3 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 07:09:43,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:43,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:43,353 INFO L175 Difference]: Start difference. First operand has 980 places, 1008 transitions, 2294 flow. Second operand 3 states and 3294 transitions. [2023-11-29 07:09:43,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 981 places, 1009 transitions, 2352 flow [2023-11-29 07:09:43,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 1009 transitions, 2334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:43,366 INFO L231 Difference]: Finished difference. Result has 979 places, 1007 transitions, 2280 flow [2023-11-29 07:09:43,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1004, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2280, PETRI_PLACES=979, PETRI_TRANSITIONS=1007} [2023-11-29 07:09:43,367 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -78 predicate places. [2023-11-29 07:09:43,368 INFO L495 AbstractCegarLoop]: Abstraction has has 979 places, 1007 transitions, 2280 flow [2023-11-29 07:09:43,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1092.6666666666667) internal successors, (3278), 3 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states 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 07:09:43,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:43,368 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:43,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 07:09:43,368 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:43,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1537126746, now seen corresponding path program 1 times [2023-11-29 07:09:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279648354] [2023-11-29 07:09:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279648354] [2023-11-29 07:09:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279648354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026235794] [2023-11-29 07:09:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:43,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:43,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1092 out of 1133 [2023-11-29 07:09:43,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 979 places, 1007 transitions, 2280 flow. Second operand has 3 states, 3 states have (on average 1094.0) internal successors, (3282), 3 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states 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 07:09:43,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:43,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1092 of 1133 [2023-11-29 07:09:43,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:09:49,351 INFO L124 PetriNetUnfolderBase]: 450/8933 cut-off events. [2023-11-29 07:09:49,351 INFO L125 PetriNetUnfolderBase]: For 70/92 co-relation queries the response was YES. [2023-11-29 07:09:50,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 8933 events. 450/8933 cut-off events. For 70/92 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 92425 event pairs, 11 based on Foata normal form. 1/7784 useless extension candidates. Maximal degree in co-relation 9861. Up to 204 conditions per place. [2023-11-29 07:09:50,494 INFO L140 encePairwiseOnDemand]: 1126/1133 looper letters, 15 selfloop transitions, 3 changer transitions 0/1005 dead transitions. [2023-11-29 07:09:50,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 977 places, 1005 transitions, 2314 flow [2023-11-29 07:09:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:09:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:09:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3298 transitions. [2023-11-29 07:09:50,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9702853780523684 [2023-11-29 07:09:50,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3298 transitions. [2023-11-29 07:09:50,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3298 transitions. [2023-11-29 07:09:50,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:09:50,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3298 transitions. [2023-11-29 07:09:50,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1099.3333333333333) internal successors, (3298), 3 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states 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 07:09:50,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:50,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:09:50,504 INFO L175 Difference]: Start difference. First operand has 979 places, 1007 transitions, 2280 flow. Second operand 3 states and 3298 transitions. [2023-11-29 07:09:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 977 places, 1005 transitions, 2314 flow [2023-11-29 07:09:50,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 975 places, 1005 transitions, 2308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:09:50,523 INFO L231 Difference]: Finished difference. Result has 975 places, 1003 transitions, 2272 flow [2023-11-29 07:09:50,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2272, PETRI_PLACES=975, PETRI_TRANSITIONS=1003} [2023-11-29 07:09:50,525 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -82 predicate places. [2023-11-29 07:09:50,525 INFO L495 AbstractCegarLoop]: Abstraction has has 975 places, 1003 transitions, 2272 flow [2023-11-29 07:09:50,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1094.0) internal successors, (3282), 3 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states 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 07:09:50,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:09:50,526 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:09:50,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 07:09:50,526 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:09:50,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:09:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1083473069, now seen corresponding path program 1 times [2023-11-29 07:09:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:09:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160578804] [2023-11-29 07:09:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:09:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:09:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:09:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160578804] [2023-11-29 07:09:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160578804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:09:50,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:09:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:09:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140998193] [2023-11-29 07:09:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:09:50,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:09:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:50,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:09:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:09:50,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1097 out of 1133 [2023-11-29 07:09:50,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 975 places, 1003 transitions, 2272 flow. Second operand has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:09:50,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:09:50,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1097 of 1133 [2023-11-29 07:09:50,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:10:46,201 INFO L124 PetriNetUnfolderBase]: 7813/111653 cut-off events. [2023-11-29 07:10:46,201 INFO L125 PetriNetUnfolderBase]: For 436/440 co-relation queries the response was YES. [2023-11-29 07:10:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125932 conditions, 111653 events. 7813/111653 cut-off events. For 436/440 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 1858547 event pairs, 1056 based on Foata normal form. 0/95225 useless extension candidates. Maximal degree in co-relation 125676. Up to 4858 conditions per place. [2023-11-29 07:10:51,679 INFO L140 encePairwiseOnDemand]: 1127/1133 looper letters, 16 selfloop transitions, 3 changer transitions 0/1007 dead transitions. [2023-11-29 07:10:51,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 1007 transitions, 2322 flow [2023-11-29 07:10:51,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:10:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:10:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3313 transitions. [2023-11-29 07:10:51,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9746984407178582 [2023-11-29 07:10:51,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3313 transitions. [2023-11-29 07:10:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3313 transitions. [2023-11-29 07:10:51,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:10:51,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3313 transitions. [2023-11-29 07:10:51,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1104.3333333333333) internal successors, (3313), 3 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states 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 07:10:51,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:10:51,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:10:51,687 INFO L175 Difference]: Start difference. First operand has 975 places, 1003 transitions, 2272 flow. Second operand 3 states and 3313 transitions. [2023-11-29 07:10:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 974 places, 1007 transitions, 2322 flow [2023-11-29 07:10:51,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 972 places, 1007 transitions, 2316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:10:51,753 INFO L231 Difference]: Finished difference. Result has 973 places, 1003 transitions, 2281 flow [2023-11-29 07:10:51,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=970, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2281, PETRI_PLACES=973, PETRI_TRANSITIONS=1003} [2023-11-29 07:10:51,754 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -84 predicate places. [2023-11-29 07:10:51,754 INFO L495 AbstractCegarLoop]: Abstraction has has 973 places, 1003 transitions, 2281 flow [2023-11-29 07:10:51,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1098.3333333333333) internal successors, (3295), 3 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states 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 07:10:51,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:10:51,754 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:10:51,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 07:10:51,755 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:10:51,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:10:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash -544333961, now seen corresponding path program 1 times [2023-11-29 07:10:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:10:51,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837220555] [2023-11-29 07:10:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:10:51,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:10:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:10:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:10:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:10:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837220555] [2023-11-29 07:10:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837220555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:10:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:10:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:10:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516686580] [2023-11-29 07:10:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:10:51,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:10:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:10:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:10:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:10:51,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1092 out of 1133 [2023-11-29 07:10:51,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 1003 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 1094.3333333333333) internal successors, (3283), 3 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states 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 07:10:51,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:10:51,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1092 of 1133 [2023-11-29 07:10:51,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:21,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,404 INFO L294 olderBase$Statistics]: this new event has 513 ancestors and is not cut-off event [2023-11-29 07:11:21,404 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is not cut-off event [2023-11-29 07:11:21,404 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is not cut-off event [2023-11-29 07:11:21,404 INFO L297 olderBase$Statistics]: existing Event has 513 ancestors and is not cut-off event [2023-11-29 07:11:21,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,405 INFO L294 olderBase$Statistics]: this new event has 514 ancestors and is cut-off event [2023-11-29 07:11:21,405 INFO L297 olderBase$Statistics]: existing Event has 514 ancestors and is cut-off event [2023-11-29 07:11:21,405 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 07:11:21,405 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 07:11:21,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,407 INFO L294 olderBase$Statistics]: this new event has 513 ancestors and is not cut-off event [2023-11-29 07:11:21,407 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is not cut-off event [2023-11-29 07:11:21,407 INFO L297 olderBase$Statistics]: existing Event has 513 ancestors and is not cut-off event [2023-11-29 07:11:21,407 INFO L297 olderBase$Statistics]: existing Event has 602 ancestors and is not cut-off event [2023-11-29 07:11:21,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,408 INFO L294 olderBase$Statistics]: this new event has 514 ancestors and is cut-off event [2023-11-29 07:11:21,408 INFO L297 olderBase$Statistics]: existing Event has 514 ancestors and is cut-off event [2023-11-29 07:11:21,408 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 07:11:21,408 INFO L297 olderBase$Statistics]: existing Event has 603 ancestors and is cut-off event [2023-11-29 07:11:21,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,614 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,615 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,615 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,615 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,615 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,616 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,616 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,616 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,617 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,617 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,617 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,617 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,618 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,618 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,618 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,618 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,634 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,634 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,635 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,635 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,635 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,635 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,635 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,636 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,637 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,637 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,637 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,637 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,638 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,638 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,638 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,638 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,643 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,643 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,643 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,643 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,644 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,644 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,644 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,644 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,646 INFO L294 olderBase$Statistics]: this new event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,646 INFO L297 olderBase$Statistics]: existing Event has 517 ancestors and is not cut-off event [2023-11-29 07:11:21,646 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,646 INFO L297 olderBase$Statistics]: existing Event has 606 ancestors and is not cut-off event [2023-11-29 07:11:21,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, 2617#(= ~name_3~0 ~name_1~0), Black: 2575#true, 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,647 INFO L294 olderBase$Statistics]: this new event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,647 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,647 INFO L297 olderBase$Statistics]: existing Event has 518 ancestors and is cut-off event [2023-11-29 07:11:21,647 INFO L297 olderBase$Statistics]: existing Event has 607 ancestors and is cut-off event [2023-11-29 07:11:21,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,807 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,807 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,807 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,807 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,808 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,808 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,808 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,808 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,810 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,810 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,810 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,810 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), 2597#(= ~name_3~0 ~name_2~0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2595#true, Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,811 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,811 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,811 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,811 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), 601#L138-7true, Black: 1171#true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,816 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,816 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,816 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,816 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,817 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,817 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,817 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,817 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,819 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,819 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,819 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,819 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 2617#(= ~name_3~0 ~name_1~0), 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2615#true]) [2023-11-29 07:11:21,820 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,820 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,820 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,821 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,842 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,843 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,843 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,843 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,844 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,844 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,844 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,844 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,846 INFO L294 olderBase$Statistics]: this new event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,846 INFO L297 olderBase$Statistics]: existing Event has 521 ancestors and is not cut-off event [2023-11-29 07:11:21,846 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,846 INFO L297 olderBase$Statistics]: existing Event has 610 ancestors and is not cut-off event [2023-11-29 07:11:21,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2575#true, 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2577#(= ~name_2~0 ~name_1~0), 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,847 INFO L294 olderBase$Statistics]: this new event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,847 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,848 INFO L297 olderBase$Statistics]: existing Event has 522 ancestors and is cut-off event [2023-11-29 07:11:21,848 INFO L297 olderBase$Statistics]: existing Event has 611 ancestors and is cut-off event [2023-11-29 07:11:21,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, 656#L97-1true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,998 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is not cut-off event [2023-11-29 07:11:21,998 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is not cut-off event [2023-11-29 07:11:21,998 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is not cut-off event [2023-11-29 07:11:21,998 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is not cut-off event [2023-11-29 07:11:21,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 254#L97-2true, Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:21,999 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2023-11-29 07:11:21,999 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 07:11:21,999 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2023-11-29 07:11:22,000 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 07:11:22,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 639#L106true, 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:22,001 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is not cut-off event [2023-11-29 07:11:22,002 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is not cut-off event [2023-11-29 07:11:22,002 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is not cut-off event [2023-11-29 07:11:22,002 INFO L297 olderBase$Statistics]: existing Event has 614 ancestors and is not cut-off event [2023-11-29 07:11:22,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3338] thread2EXIT-->L138-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= v_thread2Thread1of1ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem118#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem118#1=|v_ULTIMATE.start_main_#t~mem118#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][992], [Black: 2623#(= |#race~break_15~0| 0), 1173#(= |#race~name_1~0| 0), 2550#(= |#race~name_3~0| 0), Black: 2563#(= |#race~result_8~0| 0), 1178#(= |#race~name_2~0| 0), Black: 2572#(= |#race~result_12~0| 0), Black: 2635#true, Black: 2577#(= ~name_2~0 ~name_1~0), 574#L106-1true, Black: 1171#true, 601#L138-7true, Black: 2581#true, 2637#(= |#race~nondet_0~0| 0), Black: 1176#true, 2546#(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: 2597#(= ~name_3~0 ~name_2~0), Black: 1191#(= |#race~result_4~0| 0), Black: 2536#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 2522#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2530#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2601#true, 2642#(= |#race~i_13~0| 0), Black: 1202#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 2548#true, Black: 2617#(= ~name_3~0 ~name_1~0)]) [2023-11-29 07:11:22,003 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2023-11-29 07:11:22,003 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 07:11:22,003 INFO L297 olderBase$Statistics]: existing Event has 615 ancestors and is cut-off event [2023-11-29 07:11:22,003 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2023-11-29 07:11:22,572 INFO L124 PetriNetUnfolderBase]: 3068/42815 cut-off events. [2023-11-29 07:11:22,573 INFO L125 PetriNetUnfolderBase]: For 750/1542 co-relation queries the response was YES. [2023-11-29 07:11:25,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49233 conditions, 42815 events. 3068/42815 cut-off events. For 750/1542 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 615965 event pairs, 396 based on Foata normal form. 4/36853 useless extension candidates. Maximal degree in co-relation 48976. Up to 1612 conditions per place. [2023-11-29 07:11:26,378 INFO L140 encePairwiseOnDemand]: 1126/1133 looper letters, 15 selfloop transitions, 3 changer transitions 0/1001 dead transitions. [2023-11-29 07:11:26,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1001 transitions, 2315 flow [2023-11-29 07:11:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:11:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 07:11:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3298 transitions. [2023-11-29 07:11:26,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9702853780523684 [2023-11-29 07:11:26,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3298 transitions. [2023-11-29 07:11:26,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3298 transitions. [2023-11-29 07:11:26,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:26,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3298 transitions. [2023-11-29 07:11:26,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1099.3333333333333) internal successors, (3298), 3 states have internal predecessors, (3298), 0 states have call successors, (0), 0 states 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 07:11:26,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:11:26,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1133.0) internal successors, (4532), 4 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states 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 07:11:26,390 INFO L175 Difference]: Start difference. First operand has 973 places, 1003 transitions, 2281 flow. Second operand 3 states and 3298 transitions. [2023-11-29 07:11:26,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 971 places, 1001 transitions, 2315 flow [2023-11-29 07:11:26,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 971 places, 1001 transitions, 2315 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 07:11:26,425 INFO L231 Difference]: Finished difference. Result has 971 places, 999 transitions, 2279 flow [2023-11-29 07:11:26,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2279, PETRI_PLACES=971, PETRI_TRANSITIONS=999} [2023-11-29 07:11:26,427 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -86 predicate places. [2023-11-29 07:11:26,427 INFO L495 AbstractCegarLoop]: Abstraction has has 971 places, 999 transitions, 2279 flow [2023-11-29 07:11:26,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1094.3333333333333) internal successors, (3283), 3 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states 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 07:11:26,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:26,428 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:26,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 07:11:26,429 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:11:26,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2140247260, now seen corresponding path program 1 times [2023-11-29 07:11:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177552985] [2023-11-29 07:11:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:11:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177552985] [2023-11-29 07:11:26,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177552985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:26,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:11:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442786229] [2023-11-29 07:11:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:26,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:11:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:26,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:11:26,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:11:26,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1098 out of 1133 [2023-11-29 07:11:26,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 971 places, 999 transitions, 2279 flow. Second operand has 4 states, 4 states have (on average 1099.75) internal successors, (4399), 4 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states 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 07:11:26,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:26,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1098 of 1133 [2023-11-29 07:11:26,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 07:11:52,731 INFO L124 PetriNetUnfolderBase]: 2488/44366 cut-off events. [2023-11-29 07:11:52,731 INFO L125 PetriNetUnfolderBase]: For 31/169 co-relation queries the response was YES. [2023-11-29 07:11:55,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49586 conditions, 44366 events. 2488/44366 cut-off events. For 31/169 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 587750 event pairs, 248 based on Foata normal form. 25/38420 useless extension candidates. Maximal degree in co-relation 49327. Up to 1042 conditions per place. [2023-11-29 07:11:56,045 INFO L140 encePairwiseOnDemand]: 1125/1133 looper letters, 19 selfloop transitions, 8 changer transitions 0/1012 dead transitions. [2023-11-29 07:11:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1012 transitions, 2367 flow [2023-11-29 07:11:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:11:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 07:11:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5518 transitions. [2023-11-29 07:11:56,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9740511915269197 [2023-11-29 07:11:56,051 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 5518 transitions. [2023-11-29 07:11:56,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5518 transitions. [2023-11-29 07:11:56,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 07:11:56,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 5518 transitions. [2023-11-29 07:11:56,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 1103.6) internal successors, (5518), 5 states have internal predecessors, (5518), 0 states have call successors, (0), 0 states 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 07:11:56,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1133.0) internal successors, (6798), 6 states have internal predecessors, (6798), 0 states have call successors, (0), 0 states 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 07:11:56,063 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1133.0) internal successors, (6798), 6 states have internal predecessors, (6798), 0 states have call successors, (0), 0 states 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 07:11:56,063 INFO L175 Difference]: Start difference. First operand has 971 places, 999 transitions, 2279 flow. Second operand 5 states and 5518 transitions. [2023-11-29 07:11:56,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1012 transitions, 2367 flow [2023-11-29 07:11:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1012 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 07:11:56,091 INFO L231 Difference]: Finished difference. Result has 976 places, 1003 transitions, 2319 flow [2023-11-29 07:11:56,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1133, PETRI_DIFFERENCE_MINUEND_FLOW=2273, PETRI_DIFFERENCE_MINUEND_PLACES=969, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2319, PETRI_PLACES=976, PETRI_TRANSITIONS=1003} [2023-11-29 07:11:56,092 INFO L281 CegarLoopForPetriNet]: 1057 programPoint places, -81 predicate places. [2023-11-29 07:11:56,092 INFO L495 AbstractCegarLoop]: Abstraction has has 976 places, 1003 transitions, 2319 flow [2023-11-29 07:11:56,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1099.75) internal successors, (4399), 4 states have internal predecessors, (4399), 0 states have call successors, (0), 0 states 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 07:11:56,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 07:11:56,093 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:11:56,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 07:11:56,093 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 280 more)] === [2023-11-29 07:11:56,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 405736347, now seen corresponding path program 1 times [2023-11-29 07:11:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001176649] [2023-11-29 07:11:56,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 07:11:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001176649] [2023-11-29 07:11:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001176649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:11:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:11:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:11:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507539820] [2023-11-29 07:11:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:11:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:11:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:11:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:11:56,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1133 [2023-11-29 07:11:56,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 976 places, 1003 transitions, 2319 flow. Second operand has 3 states, 3 states have (on average 1095.3333333333333) internal successors, (3286), 3 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states 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 07:11:56,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 07:11:56,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1133 [2023-11-29 07:11:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand