./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.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_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/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_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/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_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:21:26,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:21:26,181 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-28 20:21:26,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:21:26,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:21:26,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:21:26,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:21:26,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:21:26,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:21:26,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:21:26,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:21:26,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:21:26,224 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:21:26,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:21:26,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:21:26,225 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:21:26,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:21:26,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:21:26,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:21:26,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:21:26,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:21:26,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:21:26,238 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-28 20:21:26,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:21:26,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:21:26,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:21:26,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:21:26,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:21:26,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:21:26,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:21:26,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:26,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:21:26,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:21:26,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:21:26,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:21:26,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:21:26,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:21:26,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:21:26,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:21:26,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:21:26,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:21:26,244 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_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/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_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2023-11-28 20:21:26,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:21:26,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:21:26,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:21:26,491 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:21:26,492 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:21:26,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-28 20:21:29,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:21:29,465 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:21:29,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2023-11-28 20:21:29,472 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/data/abae469f9/0c22c2f0a2da4c2cbe2443f0310c037d/FLAG27ef53be7 [2023-11-28 20:21:29,484 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/data/abae469f9/0c22c2f0a2da4c2cbe2443f0310c037d [2023-11-28 20:21:29,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:21:29,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:21:29,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:29,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:21:29,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:21:29,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39bb7374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29, skipping insertion in model container [2023-11-28 20:21:29,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:21:29,687 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:29,698 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:21:29,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:21:29,754 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:21:29,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29 WrapperNode [2023-11-28 20:21:29,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:21:29,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:29,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:21:29,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:21:29,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,810 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 279 [2023-11-28 20:21:29,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:21:29,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:21:29,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:21:29,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:21:29,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:21:29,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:21:29,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:21:29,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:21:29,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (1/1) ... [2023-11-28 20:21:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:21:29,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:21:29,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:21:29,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:21:29,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:21:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:21:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-28 20:21:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-28 20:21:29,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-28 20:21:29,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-28 20:21:29,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-28 20:21:29,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-28 20:21:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-28 20:21:29,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-28 20:21:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-28 20:21:29,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-28 20:21:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-28 20:21:29,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-28 20:21:29,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-28 20:21:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-28 20:21:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-28 20:21:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:21:29,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:21:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:21:29,958 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:21:30,087 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:21:30,089 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:21:30,608 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:21:30,630 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:21:30,630 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-28 20:21:30,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:30 BoogieIcfgContainer [2023-11-28 20:21:30,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:21:30,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:21:30,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:21:30,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:21:30,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:21:29" (1/3) ... [2023-11-28 20:21:30,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2715bf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:30, skipping insertion in model container [2023-11-28 20:21:30,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:21:29" (2/3) ... [2023-11-28 20:21:30,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2715bf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:21:30, skipping insertion in model container [2023-11-28 20:21:30,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:30" (3/3) ... [2023-11-28 20:21:30,642 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-11-28 20:21:30,650 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 20:21:30,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:21:30,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-11-28 20:21:30,659 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:21:30,784 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-28 20:21:30,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 475 transitions, 992 flow [2023-11-28 20:21:31,041 INFO L124 PetriNetUnfolderBase]: 24/469 cut-off events. [2023-11-28 20:21:31,042 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-28 20:21:31,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 469 events. 24/469 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 851 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2023-11-28 20:21:31,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 475 transitions, 992 flow [2023-11-28 20:21:31,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 430 transitions, 896 flow [2023-11-28 20:21:31,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:21:31,087 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7e1e2fa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:21:31,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2023-11-28 20:21:31,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:21:31,095 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-28 20:21:31,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:21:31,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:31,096 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] [2023-11-28 20:21:31,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:31,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1650698020, now seen corresponding path program 1 times [2023-11-28 20:21:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998535354] [2023-11-28 20:21:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:31,366 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-28 20:21:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998535354] [2023-11-28 20:21:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998535354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:31,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:31,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597426275] [2023-11-28 20:21:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:31,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:31,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:31,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 430 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:31,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:31,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:31,680 INFO L124 PetriNetUnfolderBase]: 40/557 cut-off events. [2023-11-28 20:21:31,681 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2023-11-28 20:21:31,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 557 events. 40/557 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1859 event pairs, 20 based on Foata normal form. 91/532 useless extension candidates. Maximal degree in co-relation 460. Up to 68 conditions per place. [2023-11-28 20:21:31,715 INFO L140 encePairwiseOnDemand]: 465/475 looper letters, 22 selfloop transitions, 2 changer transitions 1/422 dead transitions. [2023-11-28 20:21:31,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 422 transitions, 928 flow [2023-11-28 20:21:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:21:31,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:21:31,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:21:31,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:21:31,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:31,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:21:31,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,795 INFO L175 Difference]: Start difference. First operand has 427 places, 430 transitions, 896 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:21:31,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 422 transitions, 928 flow [2023-11-28 20:21:31,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 422 transitions, 904 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-11-28 20:21:31,822 INFO L231 Difference]: Finished difference. Result has 416 places, 421 transitions, 858 flow [2023-11-28 20:21:31,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=416, PETRI_TRANSITIONS=421} [2023-11-28 20:21:31,829 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -11 predicate places. [2023-11-28 20:21:31,830 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 421 transitions, 858 flow [2023-11-28 20:21:31,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:31,831 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-28 20:21:31,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:21:31,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:31,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 752302226, now seen corresponding path program 1 times [2023-11-28 20:21:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544879521] [2023-11-28 20:21:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:31,907 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-28 20:21:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544879521] [2023-11-28 20:21:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544879521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892968650] [2023-11-28 20:21:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:31,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:31,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:31,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 421 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:31,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:31,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:31,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:32,148 INFO L124 PetriNetUnfolderBase]: 40/555 cut-off events. [2023-11-28 20:21:32,148 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-28 20:21:32,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 555 events. 40/555 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1815 event pairs, 20 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 617. Up to 68 conditions per place. [2023-11-28 20:21:32,157 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2023-11-28 20:21:32,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 420 transitions, 904 flow [2023-11-28 20:21:32,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:32,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:32,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:32,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,172 INFO L175 Difference]: Start difference. First operand has 416 places, 421 transitions, 858 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:32,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 420 transitions, 904 flow [2023-11-28 20:21:32,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 420 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:32,180 INFO L231 Difference]: Finished difference. Result has 414 places, 420 transitions, 856 flow [2023-11-28 20:21:32,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=414, PETRI_TRANSITIONS=420} [2023-11-28 20:21:32,182 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -13 predicate places. [2023-11-28 20:21:32,182 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 420 transitions, 856 flow [2023-11-28 20:21:32,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:32,183 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] [2023-11-28 20:21:32,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:21:32,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:32,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -453054482, now seen corresponding path program 1 times [2023-11-28 20:21:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:32,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74727020] [2023-11-28 20:21:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:32,245 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-28 20:21:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74727020] [2023-11-28 20:21:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74727020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733914674] [2023-11-28 20:21:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:32,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:32,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:32,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 420 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:32,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:32,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:32,419 INFO L124 PetriNetUnfolderBase]: 40/554 cut-off events. [2023-11-28 20:21:32,419 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 20:21:32,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 554 events. 40/554 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1752 event pairs, 20 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 605. Up to 68 conditions per place. [2023-11-28 20:21:32,427 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2023-11-28 20:21:32,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 419 transitions, 902 flow [2023-11-28 20:21:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:32,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:32,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:32,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,441 INFO L175 Difference]: Start difference. First operand has 414 places, 420 transitions, 856 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:32,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 419 transitions, 902 flow [2023-11-28 20:21:32,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 419 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:32,448 INFO L231 Difference]: Finished difference. Result has 413 places, 419 transitions, 854 flow [2023-11-28 20:21:32,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=413, PETRI_TRANSITIONS=419} [2023-11-28 20:21:32,449 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -14 predicate places. [2023-11-28 20:21:32,450 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 419 transitions, 854 flow [2023-11-28 20:21:32,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:32,451 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] [2023-11-28 20:21:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:21:32,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:32,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -222115273, now seen corresponding path program 1 times [2023-11-28 20:21:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032926440] [2023-11-28 20:21:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:32,502 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-28 20:21:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:32,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032926440] [2023-11-28 20:21:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032926440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:32,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:32,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818202175] [2023-11-28 20:21:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:32,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:32,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:32,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 419 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:32,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:32,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:32,690 INFO L124 PetriNetUnfolderBase]: 40/553 cut-off events. [2023-11-28 20:21:32,690 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-28 20:21:32,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 553 events. 40/553 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1696 event pairs, 20 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 593. Up to 68 conditions per place. [2023-11-28 20:21:32,697 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2023-11-28 20:21:32,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 418 transitions, 900 flow [2023-11-28 20:21:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:32,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:32,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:32,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,710 INFO L175 Difference]: Start difference. First operand has 413 places, 419 transitions, 854 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:32,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 418 transitions, 900 flow [2023-11-28 20:21:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 418 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:32,717 INFO L231 Difference]: Finished difference. Result has 412 places, 418 transitions, 852 flow [2023-11-28 20:21:32,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=412, PETRI_TRANSITIONS=418} [2023-11-28 20:21:32,719 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -15 predicate places. [2023-11-28 20:21:32,719 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 418 transitions, 852 flow [2023-11-28 20:21:32,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:32,720 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] [2023-11-28 20:21:32,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:21:32,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:32,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 406414307, now seen corresponding path program 1 times [2023-11-28 20:21:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009427931] [2023-11-28 20:21:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:32,766 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-28 20:21:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009427931] [2023-11-28 20:21:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009427931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29758808] [2023-11-28 20:21:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:32,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:32,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:32,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 418 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:32,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:32,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:32,922 INFO L124 PetriNetUnfolderBase]: 40/552 cut-off events. [2023-11-28 20:21:32,923 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-28 20:21:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 552 events. 40/552 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1630 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 581. Up to 68 conditions per place. [2023-11-28 20:21:32,932 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2023-11-28 20:21:32,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 417 transitions, 898 flow [2023-11-28 20:21:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:32,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:32,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:32,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:32,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,945 INFO L175 Difference]: Start difference. First operand has 412 places, 418 transitions, 852 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:32,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 417 transitions, 898 flow [2023-11-28 20:21:32,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 417 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:32,952 INFO L231 Difference]: Finished difference. Result has 411 places, 417 transitions, 850 flow [2023-11-28 20:21:32,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=411, PETRI_TRANSITIONS=417} [2023-11-28 20:21:32,953 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -16 predicate places. [2023-11-28 20:21:32,953 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 417 transitions, 850 flow [2023-11-28 20:21:32,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:32,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:32,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:32,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:21:32,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:32,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 302023988, now seen corresponding path program 1 times [2023-11-28 20:21:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431452956] [2023-11-28 20:21:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:33,003 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-28 20:21:33,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431452956] [2023-11-28 20:21:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431452956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:33,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:33,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:33,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108812238] [2023-11-28 20:21:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:33,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:33,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 475 [2023-11-28 20:21:33,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:33,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 475 [2023-11-28 20:21:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:33,182 INFO L124 PetriNetUnfolderBase]: 40/551 cut-off events. [2023-11-28 20:21:33,182 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-28 20:21:33,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 551 events. 40/551 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1570 event pairs, 20 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 569. Up to 68 conditions per place. [2023-11-28 20:21:33,190 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 22 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2023-11-28 20:21:33,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 416 transitions, 896 flow [2023-11-28 20:21:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:33,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:33,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:33,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:33,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:33,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:33,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,206 INFO L175 Difference]: Start difference. First operand has 411 places, 417 transitions, 850 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:33,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 416 transitions, 896 flow [2023-11-28 20:21:33,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 416 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:33,214 INFO L231 Difference]: Finished difference. Result has 410 places, 416 transitions, 848 flow [2023-11-28 20:21:33,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=410, PETRI_TRANSITIONS=416} [2023-11-28 20:21:33,216 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -17 predicate places. [2023-11-28 20:21:33,216 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 416 transitions, 848 flow [2023-11-28 20:21:33,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:33,218 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] [2023-11-28 20:21:33,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:21:33,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:33,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash -497961939, now seen corresponding path program 1 times [2023-11-28 20:21:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532872108] [2023-11-28 20:21:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:21:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532872108] [2023-11-28 20:21:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532872108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515593364] [2023-11-28 20:21:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:33,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:33,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 475 [2023-11-28 20:21:33,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 416 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:33,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:33,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 475 [2023-11-28 20:21:33,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:34,314 INFO L124 PetriNetUnfolderBase]: 758/4855 cut-off events. [2023-11-28 20:21:34,314 INFO L125 PetriNetUnfolderBase]: For 63/80 co-relation queries the response was YES. [2023-11-28 20:21:34,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5866 conditions, 4855 events. 758/4855 cut-off events. For 63/80 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 45305 event pairs, 387 based on Foata normal form. 0/3573 useless extension candidates. Maximal degree in co-relation 5797. Up to 942 conditions per place. [2023-11-28 20:21:34,414 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 27 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2023-11-28 20:21:34,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 415 transitions, 904 flow [2023-11-28 20:21:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1335 transitions. [2023-11-28 20:21:34,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2023-11-28 20:21:34,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1335 transitions. [2023-11-28 20:21:34,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1335 transitions. [2023-11-28 20:21:34,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:34,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1335 transitions. [2023-11-28 20:21:34,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,430 INFO L175 Difference]: Start difference. First operand has 410 places, 416 transitions, 848 flow. Second operand 3 states and 1335 transitions. [2023-11-28 20:21:34,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 415 transitions, 904 flow [2023-11-28 20:21:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:34,439 INFO L231 Difference]: Finished difference. Result has 409 places, 415 transitions, 846 flow [2023-11-28 20:21:34,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=409, PETRI_TRANSITIONS=415} [2023-11-28 20:21:34,441 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -18 predicate places. [2023-11-28 20:21:34,441 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 415 transitions, 846 flow [2023-11-28 20:21:34,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:34,442 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] [2023-11-28 20:21:34,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:21:34,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:34,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1051112528, now seen corresponding path program 1 times [2023-11-28 20:21:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543777506] [2023-11-28 20:21:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:34,491 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-28 20:21:34,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543777506] [2023-11-28 20:21:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543777506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119293548] [2023-11-28 20:21:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:34,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:34,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:34,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:34,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:34,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 415 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:34,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:34,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:34,693 INFO L124 PetriNetUnfolderBase]: 55/545 cut-off events. [2023-11-28 20:21:34,694 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2023-11-28 20:21:34,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 545 events. 55/545 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1914 event pairs, 30 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 617. Up to 90 conditions per place. [2023-11-28 20:21:34,702 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2023-11-28 20:21:34,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 415 transitions, 915 flow [2023-11-28 20:21:34,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-28 20:21:34,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-28 20:21:34,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-28 20:21:34,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-28 20:21:34,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:34,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-28 20:21:34,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 446.6666666666667) internal successors, (1340), 3 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,721 INFO L175 Difference]: Start difference. First operand has 409 places, 415 transitions, 846 flow. Second operand 3 states and 1340 transitions. [2023-11-28 20:21:34,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 415 transitions, 915 flow [2023-11-28 20:21:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 415 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:34,734 INFO L231 Difference]: Finished difference. Result has 404 places, 410 transitions, 843 flow [2023-11-28 20:21:34,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2023-11-28 20:21:34,735 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -23 predicate places. [2023-11-28 20:21:34,736 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 843 flow [2023-11-28 20:21:34,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:34,737 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] [2023-11-28 20:21:34,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:21:34,738 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:34,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 801853608, now seen corresponding path program 1 times [2023-11-28 20:21:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710966278] [2023-11-28 20:21:34,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:34,792 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-28 20:21:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:34,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710966278] [2023-11-28 20:21:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710966278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551613628] [2023-11-28 20:21:34,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:34,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:34,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:34,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:34,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:34,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:34,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:34,985 INFO L124 PetriNetUnfolderBase]: 55/540 cut-off events. [2023-11-28 20:21:34,985 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-28 20:21:34,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 540 events. 55/540 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1897 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 600. Up to 90 conditions per place. [2023-11-28 20:21:34,994 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 29 selfloop transitions, 3 changer transitions 0/410 dead transitions. [2023-11-28 20:21:34,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 410 transitions, 912 flow [2023-11-28 20:21:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1340 transitions. [2023-11-28 20:21:35,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9403508771929825 [2023-11-28 20:21:35,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1340 transitions. [2023-11-28 20:21:35,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1340 transitions. [2023-11-28 20:21:35,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:35,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1340 transitions. [2023-11-28 20:21:35,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 446.6666666666667) internal successors, (1340), 3 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,011 INFO L175 Difference]: Start difference. First operand has 404 places, 410 transitions, 843 flow. Second operand 3 states and 1340 transitions. [2023-11-28 20:21:35,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 410 transitions, 912 flow [2023-11-28 20:21:35,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 410 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:35,023 INFO L231 Difference]: Finished difference. Result has 400 places, 405 transitions, 841 flow [2023-11-28 20:21:35,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=400, PETRI_TRANSITIONS=405} [2023-11-28 20:21:35,025 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -27 predicate places. [2023-11-28 20:21:35,025 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 405 transitions, 841 flow [2023-11-28 20:21:35,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:35,026 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] [2023-11-28 20:21:35,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:21:35,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:35,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -999268320, now seen corresponding path program 1 times [2023-11-28 20:21:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764232615] [2023-11-28 20:21:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:35,084 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-28 20:21:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764232615] [2023-11-28 20:21:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764232615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:35,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:35,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175662943] [2023-11-28 20:21:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:35,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:35,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 405 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:35,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:35,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:35,396 INFO L124 PetriNetUnfolderBase]: 71/899 cut-off events. [2023-11-28 20:21:35,396 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2023-11-28 20:21:35,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 899 events. 71/899 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4399 event pairs, 25 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 971. Up to 95 conditions per place. [2023-11-28 20:21:35,410 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 32 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2023-11-28 20:21:35,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 408 transitions, 925 flow [2023-11-28 20:21:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1343 transitions. [2023-11-28 20:21:35,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9424561403508772 [2023-11-28 20:21:35,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1343 transitions. [2023-11-28 20:21:35,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1343 transitions. [2023-11-28 20:21:35,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:35,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1343 transitions. [2023-11-28 20:21:35,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,424 INFO L175 Difference]: Start difference. First operand has 400 places, 405 transitions, 841 flow. Second operand 3 states and 1343 transitions. [2023-11-28 20:21:35,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 408 transitions, 925 flow [2023-11-28 20:21:35,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 408 transitions, 922 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:35,434 INFO L231 Difference]: Finished difference. Result has 396 places, 400 transitions, 839 flow [2023-11-28 20:21:35,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=396, PETRI_TRANSITIONS=400} [2023-11-28 20:21:35,435 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -31 predicate places. [2023-11-28 20:21:35,436 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 400 transitions, 839 flow [2023-11-28 20:21:35,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:35,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:21:35,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:21:35,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:35,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:35,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1771337507, now seen corresponding path program 1 times [2023-11-28 20:21:35,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:35,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154824577] [2023-11-28 20:21:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:35,478 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-28 20:21:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154824577] [2023-11-28 20:21:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154824577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169320542] [2023-11-28 20:21:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:35,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:35,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:35,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:35,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:35,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 400 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:35,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:35,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:35,776 INFO L124 PetriNetUnfolderBase]: 103/1163 cut-off events. [2023-11-28 20:21:35,776 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-28 20:21:35,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1163 events. 103/1163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6781 event pairs, 8 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 912. Up to 154 conditions per place. [2023-11-28 20:21:35,795 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 34 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2023-11-28 20:21:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 405 transitions, 933 flow [2023-11-28 20:21:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:35,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:35,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:35,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:35,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:35,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:35,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,809 INFO L175 Difference]: Start difference. First operand has 396 places, 400 transitions, 839 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 405 transitions, 933 flow [2023-11-28 20:21:35,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 405 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:35,818 INFO L231 Difference]: Finished difference. Result has 392 places, 395 transitions, 837 flow [2023-11-28 20:21:35,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=392, PETRI_TRANSITIONS=395} [2023-11-28 20:21:35,820 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -35 predicate places. [2023-11-28 20:21:35,820 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 395 transitions, 837 flow [2023-11-28 20:21:35,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:35,821 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] [2023-11-28 20:21:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:21:35,821 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:35,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1775846873, now seen corresponding path program 1 times [2023-11-28 20:21:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751618050] [2023-11-28 20:21:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:35,862 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-28 20:21:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:35,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751618050] [2023-11-28 20:21:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751618050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:35,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:35,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423235939] [2023-11-28 20:21:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:35,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:35,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:35,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 395 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:35,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:35,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:36,344 INFO L124 PetriNetUnfolderBase]: 199/1794 cut-off events. [2023-11-28 20:21:36,344 INFO L125 PetriNetUnfolderBase]: For 103/111 co-relation queries the response was YES. [2023-11-28 20:21:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1794 events. 199/1794 cut-off events. For 103/111 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12601 event pairs, 98 based on Foata normal form. 0/1517 useless extension candidates. Maximal degree in co-relation 1586. Up to 302 conditions per place. [2023-11-28 20:21:36,382 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2023-11-28 20:21:36,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 399 transitions, 926 flow [2023-11-28 20:21:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1344 transitions. [2023-11-28 20:21:36,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9431578947368421 [2023-11-28 20:21:36,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1344 transitions. [2023-11-28 20:21:36,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1344 transitions. [2023-11-28 20:21:36,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:36,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1344 transitions. [2023-11-28 20:21:36,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,397 INFO L175 Difference]: Start difference. First operand has 392 places, 395 transitions, 837 flow. Second operand 3 states and 1344 transitions. [2023-11-28 20:21:36,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 399 transitions, 926 flow [2023-11-28 20:21:36,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:36,407 INFO L231 Difference]: Finished difference. Result has 388 places, 390 transitions, 835 flow [2023-11-28 20:21:36,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=388, PETRI_TRANSITIONS=390} [2023-11-28 20:21:36,409 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -39 predicate places. [2023-11-28 20:21:36,409 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 390 transitions, 835 flow [2023-11-28 20:21:36,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:36,410 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] [2023-11-28 20:21:36,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:21:36,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:36,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1448319996, now seen corresponding path program 1 times [2023-11-28 20:21:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:36,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427411001] [2023-11-28 20:21:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:36,459 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-28 20:21:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427411001] [2023-11-28 20:21:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427411001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820968368] [2023-11-28 20:21:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:36,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2023-11-28 20:21:36,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 390 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:36,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2023-11-28 20:21:36,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:36,792 INFO L124 PetriNetUnfolderBase]: 175/1479 cut-off events. [2023-11-28 20:21:36,792 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-11-28 20:21:36,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 1479 events. 175/1479 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9516 event pairs, 50 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 996. Up to 269 conditions per place. [2023-11-28 20:21:36,809 INFO L140 encePairwiseOnDemand]: 466/475 looper letters, 33 selfloop transitions, 3 changer transitions 8/396 dead transitions. [2023-11-28 20:21:36,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 396 transitions, 932 flow [2023-11-28 20:21:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2023-11-28 20:21:36,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9438596491228071 [2023-11-28 20:21:36,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1345 transitions. [2023-11-28 20:21:36,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1345 transitions. [2023-11-28 20:21:36,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:36,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1345 transitions. [2023-11-28 20:21:36,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,819 INFO L175 Difference]: Start difference. First operand has 388 places, 390 transitions, 835 flow. Second operand 3 states and 1345 transitions. [2023-11-28 20:21:36,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 396 transitions, 932 flow [2023-11-28 20:21:36,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 396 transitions, 929 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:36,826 INFO L231 Difference]: Finished difference. Result has 384 places, 377 transitions, 817 flow [2023-11-28 20:21:36,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=384, PETRI_TRANSITIONS=377} [2023-11-28 20:21:36,827 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -43 predicate places. [2023-11-28 20:21:36,827 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 377 transitions, 817 flow [2023-11-28 20:21:36,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:36,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:21:36,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:21:36,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:36,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1239713763, now seen corresponding path program 1 times [2023-11-28 20:21:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397518007] [2023-11-28 20:21:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:36,868 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-28 20:21:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397518007] [2023-11-28 20:21:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397518007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:36,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:36,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140039247] [2023-11-28 20:21:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:36,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 475 [2023-11-28 20:21:36,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 377 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:36,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:36,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 475 [2023-11-28 20:21:36,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:45,647 INFO L124 PetriNetUnfolderBase]: 17906/61411 cut-off events. [2023-11-28 20:21:45,647 INFO L125 PetriNetUnfolderBase]: For 1608/1813 co-relation queries the response was YES. [2023-11-28 20:21:46,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89875 conditions, 61411 events. 17906/61411 cut-off events. For 1608/1813 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 859897 event pairs, 8762 based on Foata normal form. 1/53056 useless extension candidates. Maximal degree in co-relation 34226. Up to 21614 conditions per place. [2023-11-28 20:21:46,432 INFO L140 encePairwiseOnDemand]: 457/475 looper letters, 29 selfloop transitions, 6 changer transitions 59/376 dead transitions. [2023-11-28 20:21:46,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 376 transitions, 914 flow [2023-11-28 20:21:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2023-11-28 20:21:46,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9192982456140351 [2023-11-28 20:21:46,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1310 transitions. [2023-11-28 20:21:46,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1310 transitions. [2023-11-28 20:21:46,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:46,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1310 transitions. [2023-11-28 20:21:46,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:46,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:46,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:46,448 INFO L175 Difference]: Start difference. First operand has 384 places, 377 transitions, 817 flow. Second operand 3 states and 1310 transitions. [2023-11-28 20:21:46,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 376 transitions, 914 flow [2023-11-28 20:21:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 376 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:21:46,621 INFO L231 Difference]: Finished difference. Result has 367 places, 312 transitions, 713 flow [2023-11-28 20:21:46,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=367, PETRI_TRANSITIONS=312} [2023-11-28 20:21:46,622 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -60 predicate places. [2023-11-28 20:21:46,622 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 312 transitions, 713 flow [2023-11-28 20:21:46,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:46,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:46,623 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] [2023-11-28 20:21:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:21:46,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:46,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1156405926, now seen corresponding path program 1 times [2023-11-28 20:21:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227786597] [2023-11-28 20:21:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:46,684 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-28 20:21:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227786597] [2023-11-28 20:21:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227786597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:46,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:46,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262590006] [2023-11-28 20:21:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:46,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:21:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 312 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:21:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:48,038 INFO L124 PetriNetUnfolderBase]: 1604/7610 cut-off events. [2023-11-28 20:21:48,038 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2023-11-28 20:21:48,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10649 conditions, 7610 events. 1604/7610 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 82646 event pairs, 362 based on Foata normal form. 0/6408 useless extension candidates. Maximal degree in co-relation 5495. Up to 1748 conditions per place. [2023-11-28 20:21:48,146 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2023-11-28 20:21:48,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 316 transitions, 778 flow [2023-11-28 20:21:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:21:48,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:21:48,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:21:48,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:21:48,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:48,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:21:48,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:48,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:48,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:48,156 INFO L175 Difference]: Start difference. First operand has 367 places, 312 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:21:48,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 316 transitions, 778 flow [2023-11-28 20:21:48,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 778 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:21:48,164 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 715 flow [2023-11-28 20:21:48,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=315, PETRI_TRANSITIONS=311} [2023-11-28 20:21:48,165 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -112 predicate places. [2023-11-28 20:21:48,165 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 715 flow [2023-11-28 20:21:48,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.0) internal successors, (1335), 3 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:48,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:48,166 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] [2023-11-28 20:21:48,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:21:48,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:48,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash 702577034, now seen corresponding path program 1 times [2023-11-28 20:21:48,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819734736] [2023-11-28 20:21:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:48,203 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-28 20:21:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:48,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819734736] [2023-11-28 20:21:48,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819734736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:48,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:48,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739816669] [2023-11-28 20:21:48,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:48,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:48,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:48,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:48,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:21:48,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:48,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:48,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:21:48,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:50,737 INFO L124 PetriNetUnfolderBase]: 2799/13425 cut-off events. [2023-11-28 20:21:50,737 INFO L125 PetriNetUnfolderBase]: For 253/257 co-relation queries the response was YES. [2023-11-28 20:21:50,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18982 conditions, 13425 events. 2799/13425 cut-off events. For 253/257 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 163726 event pairs, 798 based on Foata normal form. 0/11627 useless extension candidates. Maximal degree in co-relation 18382. Up to 2661 conditions per place. [2023-11-28 20:21:51,058 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2023-11-28 20:21:51,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 780 flow [2023-11-28 20:21:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:21:51,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:21:51,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:21:51,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:21:51,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:51,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:21:51,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,078 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 715 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:21:51,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 780 flow [2023-11-28 20:21:51,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:51,094 INFO L231 Difference]: Finished difference. Result has 314 places, 310 transitions, 713 flow [2023-11-28 20:21:51,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=314, PETRI_TRANSITIONS=310} [2023-11-28 20:21:51,095 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-28 20:21:51,095 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 310 transitions, 713 flow [2023-11-28 20:21:51,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:51,096 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] [2023-11-28 20:21:51,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:21:51,097 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:51,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -110040722, now seen corresponding path program 1 times [2023-11-28 20:21:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948354918] [2023-11-28 20:21:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:51,162 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-28 20:21:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948354918] [2023-11-28 20:21:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948354918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132772177] [2023-11-28 20:21:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:51,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:21:51,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 310 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:51,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:51,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:21:51,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:52,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,202 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,202 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,202 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-28 20:21:52,202 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-28 20:21:52,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,203 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,203 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,203 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-28 20:21:52,203 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 218#$Ultimate##0true, Black: 521#true, 516#true, 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,213 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,213 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-28 20:21:52,213 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,213 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-28 20:21:52,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,214 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,214 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,214 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-28 20:21:52,214 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,501 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,501 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,501 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,501 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-28 20:21:52,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,501 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-28 20:21:52,502 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 20:21:52,502 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-28 20:21:52,502 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-28 20:21:52,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,619 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-28 20:21:52,619 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-28 20:21:52,619 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:52,619 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,620 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,620 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,620 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,620 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, Black: 521#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,627 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-28 20:21:52,627 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:52,627 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,627 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-28 20:21:52,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,628 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,628 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,628 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,628 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,677 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,677 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,677 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,678 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:52,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,679 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,679 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,679 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,679 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:52,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,692 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-28 20:21:52,692 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-28 20:21:52,692 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 20:21:52,692 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:52,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,693 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,693 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:52,693 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,693 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,694 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,694 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,694 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:52,694 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:52,944 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,944 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:52,944 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:52,944 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:52,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,949 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,949 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-28 20:21:52,949 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 20:21:52,949 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:52,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [278#L107-4true, 436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:52,951 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-28 20:21:52,952 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-28 20:21:52,952 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:52,952 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-28 20:21:53,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 33#$Ultimate##0true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 521#true, 306#L108-4true, 516#true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,007 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:53,007 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,007 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:53,007 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:53,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,007 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,008 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,008 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:53,008 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 33#$Ultimate##0true, 32#L57-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, 516#true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:53,009 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,009 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,009 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:53,009 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,116 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,116 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:53,116 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,116 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,116 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,117 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,117 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:53,118 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,124 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,124 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-28 20:21:53,124 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-28 20:21:53,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 218#$Ultimate##0true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:53,125 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,125 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:53,125 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,125 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,241 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,241 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,241 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,241 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:53,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 540#true, 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:53,245 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,245 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,245 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:53,245 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:53,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,371 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-28 20:21:53,371 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,371 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-28 20:21:53,371 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:53,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:53,371 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 33#$Ultimate##0true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:53,372 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-28 20:21:53,372 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:53,373 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:53,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1097] L57-2-->L57-3: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][152], [436#L49-3true, Black: 511#true, 540#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:53,470 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-28 20:21:53,470 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-28 20:21:53,470 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 20:21:53,470 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:54,277 INFO L124 PetriNetUnfolderBase]: 2898/13264 cut-off events. [2023-11-28 20:21:54,277 INFO L125 PetriNetUnfolderBase]: For 486/514 co-relation queries the response was YES. [2023-11-28 20:21:54,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19437 conditions, 13264 events. 2898/13264 cut-off events. For 486/514 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 159852 event pairs, 892 based on Foata normal form. 0/11650 useless extension candidates. Maximal degree in co-relation 18633. Up to 2455 conditions per place. [2023-11-28 20:21:54,581 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2023-11-28 20:21:54,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 778 flow [2023-11-28 20:21:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:21:54,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:21:54,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:21:54,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:21:54,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:54,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:21:54,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,595 INFO L175 Difference]: Start difference. First operand has 314 places, 310 transitions, 713 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:21:54,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 778 flow [2023-11-28 20:21:54,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:54,607 INFO L231 Difference]: Finished difference. Result has 313 places, 309 transitions, 711 flow [2023-11-28 20:21:54,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=313, PETRI_TRANSITIONS=309} [2023-11-28 20:21:54,608 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -114 predicate places. [2023-11-28 20:21:54,608 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 309 transitions, 711 flow [2023-11-28 20:21:54,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:54,609 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] [2023-11-28 20:21:54,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:21:54,610 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:54,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1054394131, now seen corresponding path program 1 times [2023-11-28 20:21:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660634523] [2023-11-28 20:21:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:54,662 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-28 20:21:54,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:54,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660634523] [2023-11-28 20:21:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660634523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602783294] [2023-11-28 20:21:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:54,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:54,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:54,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:21:54,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 309 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 445.6666666666667) internal successors, (1337), 3 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:54,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:54,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:21:54,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:56,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,035 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:56,035 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:56,035 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:56,035 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:56,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,036 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,036 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,036 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:56,036 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:56,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,041 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-28 20:21:56,041 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:56,042 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-28 20:21:56,042 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:56,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 391#L65-3true, Black: 531#true, 544#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:56,042 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,043 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:56,043 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,043 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:56,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,251 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,251 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:56,251 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-28 20:21:56,251 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-28 20:21:56,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 434#L81-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, Black: 506#true]) [2023-11-28 20:21:56,252 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-28 20:21:56,252 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-28 20:21:56,252 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-28 20:21:56,252 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-28 20:21:56,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, 392#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,289 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:56,289 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:56,289 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:56,289 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:56,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 218#$Ultimate##0true, Black: 521#true, 548#true, 306#L108-4true, Black: 526#true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,291 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-28 20:21:56,291 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-28 20:21:56,291 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-28 20:21:56,291 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-28 20:21:56,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1121] L65-2-->L65-3: Formula: (= |v_#race~n~0_10| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_10|} AuxVars[] AssignedVars[#race~n~0][182], [436#L49-3true, Black: 511#true, 533#(= |#race~n~0| 0), 32#L57-3true, Black: 516#true, 50#L73-3true, 548#true, Black: 521#true, 306#L108-4true, Black: 526#true, 390#L41-3true, 391#L65-3true, 544#true, Black: 531#true, Black: 501#true, 356#$Ultimate##0true, Black: 506#true]) [2023-11-28 20:21:56,432 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-28 20:21:56,432 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-28 20:21:56,432 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-28 20:21:56,432 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-28 20:21:57,101 INFO L124 PetriNetUnfolderBase]: 2506/11352 cut-off events. [2023-11-28 20:21:57,102 INFO L125 PetriNetUnfolderBase]: For 646/686 co-relation queries the response was YES. [2023-11-28 20:21:57,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16679 conditions, 11352 events. 2506/11352 cut-off events. For 646/686 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 131245 event pairs, 805 based on Foata normal form. 0/9927 useless extension candidates. Maximal degree in co-relation 15709. Up to 2102 conditions per place. [2023-11-28 20:21:57,241 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2023-11-28 20:21:57,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 776 flow [2023-11-28 20:21:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:21:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:21:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:21:57,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:21:57,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:21:57,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:21:57,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:57,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:21:57,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:57,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:57,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:57,250 INFO L175 Difference]: Start difference. First operand has 313 places, 309 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:21:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 776 flow [2023-11-28 20:21:57,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 313 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:57,258 INFO L231 Difference]: Finished difference. Result has 312 places, 308 transitions, 709 flow [2023-11-28 20:21:57,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=312, PETRI_TRANSITIONS=308} [2023-11-28 20:21:57,259 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:21:57,259 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 308 transitions, 709 flow [2023-11-28 20:21:57,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 445.6666666666667) internal successors, (1337), 3 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:57,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:57,259 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] [2023-11-28 20:21:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:21:57,259 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:57,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 58412032, now seen corresponding path program 1 times [2023-11-28 20:21:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986227369] [2023-11-28 20:21:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:57,929 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-28 20:21:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:57,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986227369] [2023-11-28 20:21:57,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986227369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:57,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:57,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:21:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995807668] [2023-11-28 20:21:57,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:57,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:21:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:21:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:21:58,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:21:58,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 308 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 446.1666666666667) internal successors, (2677), 6 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:58,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:58,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:21:58,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:21:59,162 INFO L124 PetriNetUnfolderBase]: 984/5101 cut-off events. [2023-11-28 20:21:59,162 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-28 20:21:59,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 5101 events. 984/5101 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 48588 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6330. Up to 1176 conditions per place. [2023-11-28 20:21:59,227 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2023-11-28 20:21:59,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 307 transitions, 743 flow [2023-11-28 20:21:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:21:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:21:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:21:59,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:21:59,233 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:21:59,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:21:59,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:21:59,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:21:59,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:59,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:59,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:59,242 INFO L175 Difference]: Start difference. First operand has 312 places, 308 transitions, 709 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:21:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 307 transitions, 743 flow [2023-11-28 20:21:59,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 307 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:21:59,249 INFO L231 Difference]: Finished difference. Result has 314 places, 307 transitions, 711 flow [2023-11-28 20:21:59,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=314, PETRI_TRANSITIONS=307} [2023-11-28 20:21:59,249 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -113 predicate places. [2023-11-28 20:21:59,250 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 307 transitions, 711 flow [2023-11-28 20:21:59,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.1666666666667) internal successors, (2677), 6 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:59,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:21:59,250 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] [2023-11-28 20:21:59,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:21:59,250 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:21:59,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:21:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1550933510, now seen corresponding path program 1 times [2023-11-28 20:21:59,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:21:59,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512304930] [2023-11-28 20:21:59,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:21:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:21:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:21:59,294 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-28 20:21:59,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:21:59,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512304930] [2023-11-28 20:21:59,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512304930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:21:59,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:21:59,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:21:59,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022523037] [2023-11-28 20:21:59,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:21:59,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:21:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:21:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:21:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:21:59,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:21:59,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 307 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:21:59,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:21:59,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:21:59,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:01,171 INFO L124 PetriNetUnfolderBase]: 2008/9178 cut-off events. [2023-11-28 20:22:01,171 INFO L125 PetriNetUnfolderBase]: For 496/526 co-relation queries the response was YES. [2023-11-28 20:22:01,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13292 conditions, 9178 events. 2008/9178 cut-off events. For 496/526 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 99574 event pairs, 659 based on Foata normal form. 0/8088 useless extension candidates. Maximal degree in co-relation 8753. Up to 1823 conditions per place. [2023-11-28 20:22:01,342 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2023-11-28 20:22:01,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 776 flow [2023-11-28 20:22:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:22:01,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:22:01,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:22:01,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:22:01,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:01,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:22:01,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:01,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:01,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:01,354 INFO L175 Difference]: Start difference. First operand has 314 places, 307 transitions, 711 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:22:01,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 776 flow [2023-11-28 20:22:01,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 311 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:01,366 INFO L231 Difference]: Finished difference. Result has 311 places, 306 transitions, 706 flow [2023-11-28 20:22:01,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=311, PETRI_TRANSITIONS=306} [2023-11-28 20:22:01,367 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -116 predicate places. [2023-11-28 20:22:01,367 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 306 transitions, 706 flow [2023-11-28 20:22:01,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:01,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:01,368 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] [2023-11-28 20:22:01,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:22:01,368 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:01,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1639015021, now seen corresponding path program 1 times [2023-11-28 20:22:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626769920] [2023-11-28 20:22:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:01,438 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-28 20:22:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626769920] [2023-11-28 20:22:01,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626769920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:22:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332830474] [2023-11-28 20:22:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:01,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:22:01,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:22:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:22:01,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 475 [2023-11-28 20:22:01,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 306 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:01,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:01,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 475 [2023-11-28 20:22:01,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:02,850 INFO L124 PetriNetUnfolderBase]: 1480/6778 cut-off events. [2023-11-28 20:22:02,850 INFO L125 PetriNetUnfolderBase]: For 360/384 co-relation queries the response was YES. [2023-11-28 20:22:02,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9704 conditions, 6778 events. 1480/6778 cut-off events. For 360/384 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 67195 event pairs, 435 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 8960. Up to 1488 conditions per place. [2023-11-28 20:22:02,963 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 24 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2023-11-28 20:22:02,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 771 flow [2023-11-28 20:22:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:22:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:22:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1352 transitions. [2023-11-28 20:22:02,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9487719298245614 [2023-11-28 20:22:02,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1352 transitions. [2023-11-28 20:22:02,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1352 transitions. [2023-11-28 20:22:02,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:02,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1352 transitions. [2023-11-28 20:22:02,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:02,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:02,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 475.0) internal successors, (1900), 4 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:02,973 INFO L175 Difference]: Start difference. First operand has 311 places, 306 transitions, 706 flow. Second operand 3 states and 1352 transitions. [2023-11-28 20:22:02,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 771 flow [2023-11-28 20:22:02,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:02,982 INFO L231 Difference]: Finished difference. Result has 310 places, 305 transitions, 704 flow [2023-11-28 20:22:02,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=310, PETRI_TRANSITIONS=305} [2023-11-28 20:22:02,983 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -117 predicate places. [2023-11-28 20:22:02,983 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 305 transitions, 704 flow [2023-11-28 20:22:02,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:02,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:02,984 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] [2023-11-28 20:22:02,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:22:02,984 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:02,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash -65903341, now seen corresponding path program 1 times [2023-11-28 20:22:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075185980] [2023-11-28 20:22:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:03,741 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-28 20:22:03,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:03,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075185980] [2023-11-28 20:22:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075185980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046400276] [2023-11-28 20:22:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:03,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:04,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:22:04,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 305 transitions, 704 flow. Second operand has 6 states, 6 states have (on average 446.3333333333333) internal successors, (2678), 6 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:04,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:04,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:22:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:04,989 INFO L124 PetriNetUnfolderBase]: 984/5037 cut-off events. [2023-11-28 20:22:04,989 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-28 20:22:05,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 5037 events. 984/5037 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47776 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6494. Up to 1176 conditions per place. [2023-11-28 20:22:05,070 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2023-11-28 20:22:05,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 304 transitions, 738 flow [2023-11-28 20:22:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:22:05,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:22:05,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:22:05,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:22:05,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:05,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:22:05,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:05,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:05,094 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:05,094 INFO L175 Difference]: Start difference. First operand has 310 places, 305 transitions, 704 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:22:05,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 304 transitions, 738 flow [2023-11-28 20:22:05,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:22:05,102 INFO L231 Difference]: Finished difference. Result has 312 places, 304 transitions, 706 flow [2023-11-28 20:22:05,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=312, PETRI_TRANSITIONS=304} [2023-11-28 20:22:05,102 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:22:05,102 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 304 transitions, 706 flow [2023-11-28 20:22:05,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.3333333333333) internal successors, (2678), 6 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:05,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:05,103 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] [2023-11-28 20:22:05,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:22:05,103 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:05,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1559852817, now seen corresponding path program 1 times [2023-11-28 20:22:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559468401] [2023-11-28 20:22:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:05,595 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-28 20:22:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559468401] [2023-11-28 20:22:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559468401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:05,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:05,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515646130] [2023-11-28 20:22:05,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:05,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:05,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:22:05,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 304 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 446.5) internal successors, (2679), 6 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:05,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:05,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:22:05,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:06,670 INFO L124 PetriNetUnfolderBase]: 984/5017 cut-off events. [2023-11-28 20:22:06,670 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-28 20:22:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6860 conditions, 5017 events. 984/5017 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47498 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6304. Up to 1176 conditions per place. [2023-11-28 20:22:06,733 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2023-11-28 20:22:06,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 303 transitions, 740 flow [2023-11-28 20:22:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:22:06,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:22:06,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:22:06,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:22:06,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:06,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:22:06,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:06,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:06,748 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:06,748 INFO L175 Difference]: Start difference. First operand has 312 places, 304 transitions, 706 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:22:06,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 303 transitions, 740 flow [2023-11-28 20:22:06,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 303 transitions, 733 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:06,754 INFO L231 Difference]: Finished difference. Result has 312 places, 303 transitions, 705 flow [2023-11-28 20:22:06,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=705, PETRI_PLACES=312, PETRI_TRANSITIONS=303} [2023-11-28 20:22:06,754 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:22:06,754 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 303 transitions, 705 flow [2023-11-28 20:22:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.5) internal successors, (2679), 6 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:06,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:06,755 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] [2023-11-28 20:22:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:22:06,755 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:06,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2115955284, now seen corresponding path program 1 times [2023-11-28 20:22:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564730265] [2023-11-28 20:22:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:07,325 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-28 20:22:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564730265] [2023-11-28 20:22:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564730265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:07,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:07,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585667707] [2023-11-28 20:22:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:07,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:07,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:22:07,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 303 transitions, 705 flow. Second operand has 6 states, 6 states have (on average 446.6666666666667) internal successors, (2680), 6 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:07,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:07,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:22:07,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:08,518 INFO L124 PetriNetUnfolderBase]: 984/5003 cut-off events. [2023-11-28 20:22:08,518 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-28 20:22:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 5003 events. 984/5003 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47419 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6408. Up to 1176 conditions per place. [2023-11-28 20:22:08,582 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2023-11-28 20:22:08,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 302 transitions, 739 flow [2023-11-28 20:22:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:22:08,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:22:08,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:22:08,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:22:08,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:08,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:22:08,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:08,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:08,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:08,598 INFO L175 Difference]: Start difference. First operand has 312 places, 303 transitions, 705 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:22:08,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 302 transitions, 739 flow [2023-11-28 20:22:08,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 302 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:08,607 INFO L231 Difference]: Finished difference. Result has 312 places, 302 transitions, 704 flow [2023-11-28 20:22:08,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=312, PETRI_TRANSITIONS=302} [2023-11-28 20:22:08,608 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:22:08,608 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 302 transitions, 704 flow [2023-11-28 20:22:08,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.6666666666667) internal successors, (2680), 6 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:08,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:08,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:08,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-28 20:22:08,608 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:08,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -653850341, now seen corresponding path program 1 times [2023-11-28 20:22:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117097609] [2023-11-28 20:22:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:09,429 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-28 20:22:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117097609] [2023-11-28 20:22:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117097609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:09,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:09,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230133687] [2023-11-28 20:22:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:09,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:09,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:09,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:09,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:22:09,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 302 transitions, 704 flow. Second operand has 6 states, 6 states have (on average 446.8333333333333) internal successors, (2681), 6 states have internal predecessors, (2681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:09,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:09,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:22:09,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:10,524 INFO L124 PetriNetUnfolderBase]: 984/4997 cut-off events. [2023-11-28 20:22:10,524 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-28 20:22:10,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 4997 events. 984/4997 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47336 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6584. Up to 1176 conditions per place. [2023-11-28 20:22:10,602 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 14 selfloop transitions, 4 changer transitions 0/301 dead transitions. [2023-11-28 20:22:10,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 301 transitions, 738 flow [2023-11-28 20:22:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:22:10,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:22:10,608 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:22:10,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:22:10,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:10,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:22:10,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:10,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:10,614 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:10,614 INFO L175 Difference]: Start difference. First operand has 312 places, 302 transitions, 704 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:22:10,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 301 transitions, 738 flow [2023-11-28 20:22:10,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 301 transitions, 731 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:10,620 INFO L231 Difference]: Finished difference. Result has 312 places, 301 transitions, 703 flow [2023-11-28 20:22:10,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=312, PETRI_TRANSITIONS=301} [2023-11-28 20:22:10,621 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:22:10,621 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 301 transitions, 703 flow [2023-11-28 20:22:10,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 446.8333333333333) internal successors, (2681), 6 states have internal predecessors, (2681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:10,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:22:10,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-28 20:22:10,622 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2023-11-28 20:22:10,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:22:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1572702199, now seen corresponding path program 1 times [2023-11-28 20:22:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:22:10,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614595459] [2023-11-28 20:22:10,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:22:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:22:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:22:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:22:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:22:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614595459] [2023-11-28 20:22:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614595459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:22:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:22:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:22:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364964617] [2023-11-28 20:22:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:22:11,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:22:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:22:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:22:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:22:11,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 475 [2023-11-28 20:22:11,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 301 transitions, 703 flow. Second operand has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:11,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:22:11,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 475 [2023-11-28 20:22:11,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:22:12,207 INFO L124 PetriNetUnfolderBase]: 984/4994 cut-off events. [2023-11-28 20:22:12,208 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-28 20:22:12,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 4994 events. 984/4994 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 47372 event pairs, 172 based on Foata normal form. 0/4454 useless extension candidates. Maximal degree in co-relation 6692. Up to 1176 conditions per place. [2023-11-28 20:22:12,248 INFO L140 encePairwiseOnDemand]: 470/475 looper letters, 0 selfloop transitions, 0 changer transitions 300/300 dead transitions. [2023-11-28 20:22:12,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 300 transitions, 737 flow [2023-11-28 20:22:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:22:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:22:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2683 transitions. [2023-11-28 20:22:12,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9414035087719298 [2023-11-28 20:22:12,254 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2683 transitions. [2023-11-28 20:22:12,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2683 transitions. [2023-11-28 20:22:12,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:22:12,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2683 transitions. [2023-11-28 20:22:12,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 447.1666666666667) internal successors, (2683), 6 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:12,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:12,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 475.0) internal successors, (3325), 7 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:12,262 INFO L175 Difference]: Start difference. First operand has 312 places, 301 transitions, 703 flow. Second operand 6 states and 2683 transitions. [2023-11-28 20:22:12,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 300 transitions, 737 flow [2023-11-28 20:22:12,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 300 transitions, 730 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:22:12,267 INFO L231 Difference]: Finished difference. Result has 312 places, 0 transitions, 0 flow [2023-11-28 20:22:12,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=312, PETRI_TRANSITIONS=0} [2023-11-28 20:22:12,268 INFO L281 CegarLoopForPetriNet]: 427 programPoint places, -115 predicate places. [2023-11-28 20:22:12,268 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 0 transitions, 0 flow [2023-11-28 20:22:12,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:22:12,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 103 remaining) [2023-11-28 20:22:12,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 103 remaining) [2023-11-28 20:22:12,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 103 remaining) [2023-11-28 20:22:12,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 103 remaining) [2023-11-28 20:22:12,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 103 remaining) [2023-11-28 20:22:12,273 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 103 remaining) [2023-11-28 20:22:12,274 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 103 remaining) [2023-11-28 20:22:12,275 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 103 remaining) [2023-11-28 20:22:12,276 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 103 remaining) [2023-11-28 20:22:12,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 103 remaining) [2023-11-28 20:22:12,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 103 remaining) [2023-11-28 20:22:12,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 103 remaining) [2023-11-28 20:22:12,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 103 remaining) [2023-11-28 20:22:12,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 103 remaining) [2023-11-28 20:22:12,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 103 remaining) [2023-11-28 20:22:12,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 103 remaining) [2023-11-28 20:22:12,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 103 remaining) [2023-11-28 20:22:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-28 20:22:12,280 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:22:12,286 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:22:12,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:22:12,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:12 BasicIcfg [2023-11-28 20:22:12,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:22:12,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:22:12,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:22:12,292 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:22:12,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:21:30" (3/4) ... [2023-11-28 20:22:12,294 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2023-11-28 20:22:12,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2023-11-28 20:22:12,307 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2023-11-28 20:22:12,307 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-28 20:22:12,308 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 20:22:12,309 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-28 20:22:12,406 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 20:22:12,406 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 20:22:12,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:22:12,407 INFO L158 Benchmark]: Toolchain (without parser) took 42920.32ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 123.6MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-28 20:22:12,408 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:22:12,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.96ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 110.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:22:12,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.70ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:22:12,409 INFO L158 Benchmark]: Boogie Preprocessor took 49.35ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:22:12,409 INFO L158 Benchmark]: RCFGBuilder took 771.01ms. Allocated memory is still 155.2MB. Free memory was 104.8MB in the beginning and 91.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:22:12,410 INFO L158 Benchmark]: TraceAbstraction took 41655.83ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 91.0MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-28 20:22:12,410 INFO L158 Benchmark]: Witness Printer took 114.91ms. Allocated memory is still 6.7GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-28 20:22:12,411 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.96ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 110.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.70ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.35ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 771.01ms. Allocated memory is still 155.2MB. Free memory was 104.8MB in the beginning and 91.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41655.83ms. Allocated memory was 155.2MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 91.0MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 114.91ms. Allocated memory is still 6.7GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 596 locations, 103 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.5s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1846 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 672 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3015 IncrementalHoareTripleChecker+Invalid, 3687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 672 mSolverCounterUnsat, 280 mSDtfsCounter, 3015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2612 NumberOfCodeBlocks, 2612 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2586 ConstructedInterpolants, 0 QuantifiedInterpolants, 3112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-28 20:22:12,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8313407-1a9e-4abd-b7f0-8e4f62b6c3ba/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE