./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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 f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:48:27,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:48:27,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:48:27,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:48:27,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:48:27,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:48:27,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:48:27,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:48:27,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:48:27,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:48:27,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:48:27,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:48:27,126 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:48:27,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:48:27,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:48:27,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:48:27,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:48:27,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:48:27,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:48:27,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:48:27,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:48:27,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:48:27,131 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:48:27,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:48:27,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:48:27,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:48:27,132 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:48:27,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:48:27,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:48:27,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:48:27,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:48:27,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:48:27,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:48:27,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:48:27,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:48:27,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:48:27,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:48:27,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:48:27,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:48:27,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:48:27,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:48:27,137 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_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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 -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2023-11-29 00:48:27,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:48:27,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:48:27,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:48:27,405 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:48:27,405 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:48:27,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2023-11-29 00:48:30,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:48:30,438 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:48:30,438 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2023-11-29 00:48:30,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/data/c2668431b/489629a21afa48d9908ce331636dad59/FLAGd93d45799 [2023-11-29 00:48:30,459 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/data/c2668431b/489629a21afa48d9908ce331636dad59 [2023-11-29 00:48:30,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:48:30,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:48:30,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:48:30,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:48:30,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:48:30,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49037b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30, skipping insertion in model container [2023-11-29 00:48:30,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,495 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:48:30,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:48:30,716 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:48:30,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:48:30,763 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:48:30,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30 WrapperNode [2023-11-29 00:48:30,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:48:30,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:48:30,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:48:30,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:48:30,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,813 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 268 [2023-11-29 00:48:30,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:48:30,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:48:30,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:48:30,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:48:30,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:48:30,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:48:30,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:48:30,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:48:30,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (1/1) ... [2023-11-29 00:48:30,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:48:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:48:30,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:48:30,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:48:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:48:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 00:48:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 00:48:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 00:48:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 00:48:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 00:48:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 00:48:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:48:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:48:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:48:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:48:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:48:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:48:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:48:30,928 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:48:31,032 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:48:31,034 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:48:31,395 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:48:31,409 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:48:31,409 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:48:31,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:48:31 BoogieIcfgContainer [2023-11-29 00:48:31,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:48:31,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:48:31,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:48:31,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:48:31,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:48:30" (1/3) ... [2023-11-29 00:48:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221bc814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:48:31, skipping insertion in model container [2023-11-29 00:48:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:48:30" (2/3) ... [2023-11-29 00:48:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221bc814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:48:31, skipping insertion in model container [2023-11-29 00:48:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:48:31" (3/3) ... [2023-11-29 00:48:31,419 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2023-11-29 00:48:31,426 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:48:31,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:48:31,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-29 00:48:31,435 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:48:31,557 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 00:48:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 346 transitions, 713 flow [2023-11-29 00:48:31,725 INFO L124 PetriNetUnfolderBase]: 15/343 cut-off events. [2023-11-29 00:48:31,725 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 00:48:31,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 343 events. 15/343 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 797 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2023-11-29 00:48:31,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 346 transitions, 713 flow [2023-11-29 00:48:31,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 316 transitions, 650 flow [2023-11-29 00:48:31,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:48:31,763 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;@10cf3554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:48:31,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-29 00:48:31,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:48:31,770 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-29 00:48:31,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:48:31,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:31,771 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-29 00:48:31,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:31,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1105761550, now seen corresponding path program 1 times [2023-11-29 00:48:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209985785] [2023-11-29 00:48:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:31,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209985785] [2023-11-29 00:48:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209985785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:31,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423961325] [2023-11-29 00:48:31,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:31,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:32,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2023-11-29 00:48:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 316 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:32,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2023-11-29 00:48:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:32,216 INFO L124 PetriNetUnfolderBase]: 18/506 cut-off events. [2023-11-29 00:48:32,216 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 00:48:32,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 506 events. 18/506 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2176 event pairs, 5 based on Foata normal form. 20/451 useless extension candidates. Maximal degree in co-relation 393. Up to 22 conditions per place. [2023-11-29 00:48:32,226 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2023-11-29 00:48:32,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 662 flow [2023-11-29 00:48:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2023-11-29 00:48:32,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9527938342967245 [2023-11-29 00:48:32,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 989 transitions. [2023-11-29 00:48:32,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 989 transitions. [2023-11-29 00:48:32,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:32,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 989 transitions. [2023-11-29 00:48:32,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,271 INFO L175 Difference]: Start difference. First operand has 313 places, 316 transitions, 650 flow. Second operand 3 states and 989 transitions. [2023-11-29 00:48:32,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 662 flow [2023-11-29 00:48:32,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 309 transitions, 650 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 00:48:32,285 INFO L231 Difference]: Finished difference. Result has 308 places, 309 transitions, 628 flow [2023-11-29 00:48:32,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=306, 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=628, PETRI_PLACES=308, PETRI_TRANSITIONS=309} [2023-11-29 00:48:32,291 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -5 predicate places. [2023-11-29 00:48:32,291 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 309 transitions, 628 flow [2023-11-29 00:48:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:32,292 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] [2023-11-29 00:48:32,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:48:32,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:32,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2067975721, now seen corresponding path program 1 times [2023-11-29 00:48:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868358448] [2023-11-29 00:48:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:32,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868358448] [2023-11-29 00:48:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868358448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:32,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585785687] [2023-11-29 00:48:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:32,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2023-11-29 00:48:32,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 309 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:32,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2023-11-29 00:48:32,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:32,564 INFO L124 PetriNetUnfolderBase]: 17/534 cut-off events. [2023-11-29 00:48:32,564 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 00:48:32,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 534 events. 17/534 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2052 event pairs, 5 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 534. Up to 23 conditions per place. [2023-11-29 00:48:32,573 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2023-11-29 00:48:32,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 308 transitions, 652 flow [2023-11-29 00:48:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2023-11-29 00:48:32,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2023-11-29 00:48:32,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2023-11-29 00:48:32,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2023-11-29 00:48:32,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:32,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2023-11-29 00:48:32,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,587 INFO L175 Difference]: Start difference. First operand has 308 places, 309 transitions, 628 flow. Second operand 3 states and 983 transitions. [2023-11-29 00:48:32,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 308 transitions, 652 flow [2023-11-29 00:48:32,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 308 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:32,598 INFO L231 Difference]: Finished difference. Result has 307 places, 308 transitions, 626 flow [2023-11-29 00:48:32,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=305, 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=626, PETRI_PLACES=307, PETRI_TRANSITIONS=308} [2023-11-29 00:48:32,600 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -6 predicate places. [2023-11-29 00:48:32,600 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 308 transitions, 626 flow [2023-11-29 00:48:32,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:32,601 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] [2023-11-29 00:48:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:48:32,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:32,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1598590084, now seen corresponding path program 1 times [2023-11-29 00:48:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324448018] [2023-11-29 00:48:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324448018] [2023-11-29 00:48:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324448018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732346600] [2023-11-29 00:48:32,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:32,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:32,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 346 [2023-11-29 00:48:32,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 346 [2023-11-29 00:48:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:32,885 INFO L124 PetriNetUnfolderBase]: 33/710 cut-off events. [2023-11-29 00:48:32,885 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:48:32,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 710 events. 33/710 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3793 event pairs, 12 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 719. Up to 35 conditions per place. [2023-11-29 00:48:32,897 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 12 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2023-11-29 00:48:32,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 307 transitions, 652 flow [2023-11-29 00:48:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2023-11-29 00:48:32,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9450867052023122 [2023-11-29 00:48:32,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 981 transitions. [2023-11-29 00:48:32,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 981 transitions. [2023-11-29 00:48:32,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:32,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 981 transitions. [2023-11-29 00:48:32,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,911 INFO L175 Difference]: Start difference. First operand has 307 places, 308 transitions, 626 flow. Second operand 3 states and 981 transitions. [2023-11-29 00:48:32,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 307 transitions, 652 flow [2023-11-29 00:48:32,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 307 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:32,918 INFO L231 Difference]: Finished difference. Result has 306 places, 307 transitions, 624 flow [2023-11-29 00:48:32,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=306, PETRI_TRANSITIONS=307} [2023-11-29 00:48:32,920 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -7 predicate places. [2023-11-29 00:48:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 307 transitions, 624 flow [2023-11-29 00:48:32,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:32,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:32,922 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] [2023-11-29 00:48:32,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:48:32,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -104337398, now seen corresponding path program 1 times [2023-11-29 00:48:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665997739] [2023-11-29 00:48:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665997739] [2023-11-29 00:48:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665997739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:32,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:32,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851079491] [2023-11-29 00:48:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:32,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:32,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:33,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2023-11-29 00:48:33,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 307 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:33,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2023-11-29 00:48:33,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:33,149 INFO L124 PetriNetUnfolderBase]: 22/594 cut-off events. [2023-11-29 00:48:33,149 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 00:48:33,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 594 events. 22/594 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2854 event pairs, 7 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 582. Up to 25 conditions per place. [2023-11-29 00:48:33,157 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2023-11-29 00:48:33,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 648 flow [2023-11-29 00:48:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2023-11-29 00:48:33,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2023-11-29 00:48:33,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:33,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,171 INFO L175 Difference]: Start difference. First operand has 306 places, 307 transitions, 624 flow. Second operand 3 states and 983 transitions. [2023-11-29 00:48:33,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 648 flow [2023-11-29 00:48:33,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:33,178 INFO L231 Difference]: Finished difference. Result has 305 places, 306 transitions, 622 flow [2023-11-29 00:48:33,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=303, 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=622, PETRI_PLACES=305, PETRI_TRANSITIONS=306} [2023-11-29 00:48:33,180 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -8 predicate places. [2023-11-29 00:48:33,180 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 306 transitions, 622 flow [2023-11-29 00:48:33,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:33,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:33,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:48:33,182 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:33,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1673326894, now seen corresponding path program 1 times [2023-11-29 00:48:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:33,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745764310] [2023-11-29 00:48:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745764310] [2023-11-29 00:48:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745764310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317889691] [2023-11-29 00:48:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:33,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:33,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:33,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:33,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 346 [2023-11-29 00:48:33,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 306 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:33,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 346 [2023-11-29 00:48:33,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:33,460 INFO L124 PetriNetUnfolderBase]: 43/749 cut-off events. [2023-11-29 00:48:33,460 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 00:48:33,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 749 events. 43/749 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3760 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 752. Up to 50 conditions per place. [2023-11-29 00:48:33,471 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 13 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2023-11-29 00:48:33,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 650 flow [2023-11-29 00:48:33,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2023-11-29 00:48:33,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9431599229287091 [2023-11-29 00:48:33,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2023-11-29 00:48:33,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2023-11-29 00:48:33,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:33,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2023-11-29 00:48:33,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,484 INFO L175 Difference]: Start difference. First operand has 305 places, 306 transitions, 622 flow. Second operand 3 states and 979 transitions. [2023-11-29 00:48:33,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 650 flow [2023-11-29 00:48:33,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:33,492 INFO L231 Difference]: Finished difference. Result has 304 places, 305 transitions, 620 flow [2023-11-29 00:48:33,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=302, 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=620, PETRI_PLACES=304, PETRI_TRANSITIONS=305} [2023-11-29 00:48:33,493 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -9 predicate places. [2023-11-29 00:48:33,493 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 305 transitions, 620 flow [2023-11-29 00:48:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:33,495 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] [2023-11-29 00:48:33,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:48:33,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:33,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 230711415, now seen corresponding path program 1 times [2023-11-29 00:48:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:33,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573759465] [2023-11-29 00:48:33,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:33,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573759465] [2023-11-29 00:48:33,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573759465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:33,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:33,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344095678] [2023-11-29 00:48:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:33,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2023-11-29 00:48:33,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:33,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2023-11-29 00:48:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:33,661 INFO L124 PetriNetUnfolderBase]: 16/416 cut-off events. [2023-11-29 00:48:33,661 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 00:48:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 416 events. 16/416 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1466 event pairs, 7 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 385. Up to 25 conditions per place. [2023-11-29 00:48:33,668 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2023-11-29 00:48:33,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 644 flow [2023-11-29 00:48:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2023-11-29 00:48:33,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2023-11-29 00:48:33,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:33,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 983 transitions. [2023-11-29 00:48:33,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,682 INFO L175 Difference]: Start difference. First operand has 304 places, 305 transitions, 620 flow. Second operand 3 states and 983 transitions. [2023-11-29 00:48:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 644 flow [2023-11-29 00:48:33,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:33,700 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 618 flow [2023-11-29 00:48:33,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2023-11-29 00:48:33,702 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -10 predicate places. [2023-11-29 00:48:33,702 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 618 flow [2023-11-29 00:48:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:33,703 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] [2023-11-29 00:48:33,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:48:33,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:33,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1918244046, now seen corresponding path program 1 times [2023-11-29 00:48:33,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:33,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944831693] [2023-11-29 00:48:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:33,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944831693] [2023-11-29 00:48:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944831693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713990832] [2023-11-29 00:48:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:33,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:33,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 346 [2023-11-29 00:48:33,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:33,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 346 [2023-11-29 00:48:33,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:33,909 INFO L124 PetriNetUnfolderBase]: 31/656 cut-off events. [2023-11-29 00:48:33,909 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 00:48:33,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 656 events. 31/656 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3029 event pairs, 6 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 629. Up to 31 conditions per place. [2023-11-29 00:48:33,919 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 13 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2023-11-29 00:48:33,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 306 transitions, 654 flow [2023-11-29 00:48:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-11-29 00:48:33,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2023-11-29 00:48:33,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-11-29 00:48:33,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-11-29 00:48:33,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:33,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-11-29 00:48:33,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,931 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 618 flow. Second operand 3 states and 992 transitions. [2023-11-29 00:48:33,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 306 transitions, 654 flow [2023-11-29 00:48:33,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 306 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:33,939 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 624 flow [2023-11-29 00:48:33,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2023-11-29 00:48:33,941 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:33,941 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 624 flow [2023-11-29 00:48:33,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:33,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:33,942 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-29 00:48:33,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:48:33,943 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:33,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1867719547, now seen corresponding path program 1 times [2023-11-29 00:48:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887885104] [2023-11-29 00:48:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887885104] [2023-11-29 00:48:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887885104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:34,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:34,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349453814] [2023-11-29 00:48:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:34,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:34,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 346 [2023-11-29 00:48:34,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:34,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 346 [2023-11-29 00:48:34,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:34,259 INFO L124 PetriNetUnfolderBase]: 70/1065 cut-off events. [2023-11-29 00:48:34,259 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 00:48:34,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 1065 events. 70/1065 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7441 event pairs, 10 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1029. Up to 73 conditions per place. [2023-11-29 00:48:34,275 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 15 selfloop transitions, 3 changer transitions 0/306 dead transitions. [2023-11-29 00:48:34,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 666 flow [2023-11-29 00:48:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2023-11-29 00:48:34,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9508670520231214 [2023-11-29 00:48:34,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 987 transitions. [2023-11-29 00:48:34,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 987 transitions. [2023-11-29 00:48:34,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:34,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 987 transitions. [2023-11-29 00:48:34,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,288 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 624 flow. Second operand 3 states and 987 transitions. [2023-11-29 00:48:34,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 306 transitions, 666 flow [2023-11-29 00:48:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 306 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:34,297 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 639 flow [2023-11-29 00:48:34,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2023-11-29 00:48:34,298 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:34,299 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 639 flow [2023-11-29 00:48:34,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:34,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:34,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:48:34,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:34,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 69085531, now seen corresponding path program 1 times [2023-11-29 00:48:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016467430] [2023-11-29 00:48:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016467430] [2023-11-29 00:48:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016467430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:34,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:34,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105196341] [2023-11-29 00:48:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:34,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 346 [2023-11-29 00:48:34,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:34,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 346 [2023-11-29 00:48:34,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:34,550 INFO L124 PetriNetUnfolderBase]: 31/849 cut-off events. [2023-11-29 00:48:34,550 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-29 00:48:34,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 849 events. 31/849 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4536 event pairs, 2 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 764. Up to 38 conditions per place. [2023-11-29 00:48:34,565 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 16 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2023-11-29 00:48:34,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 309 transitions, 690 flow [2023-11-29 00:48:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2023-11-29 00:48:34,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9585741811175337 [2023-11-29 00:48:34,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 995 transitions. [2023-11-29 00:48:34,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 995 transitions. [2023-11-29 00:48:34,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:34,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 995 transitions. [2023-11-29 00:48:34,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,577 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 639 flow. Second operand 3 states and 995 transitions. [2023-11-29 00:48:34,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 309 transitions, 690 flow [2023-11-29 00:48:34,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 309 transitions, 690 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:34,584 INFO L231 Difference]: Finished difference. Result has 303 places, 304 transitions, 649 flow [2023-11-29 00:48:34,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=303, PETRI_TRANSITIONS=304} [2023-11-29 00:48:34,586 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -10 predicate places. [2023-11-29 00:48:34,586 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 304 transitions, 649 flow [2023-11-29 00:48:34,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:34,587 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] [2023-11-29 00:48:34,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:48:34,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:34,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash -722770243, now seen corresponding path program 1 times [2023-11-29 00:48:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283101716] [2023-11-29 00:48:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283101716] [2023-11-29 00:48:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283101716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539089254] [2023-11-29 00:48:34,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:34,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:34,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 346 [2023-11-29 00:48:34,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 304 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:34,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 346 [2023-11-29 00:48:34,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:34,826 INFO L124 PetriNetUnfolderBase]: 39/862 cut-off events. [2023-11-29 00:48:34,827 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2023-11-29 00:48:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 862 events. 39/862 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4873 event pairs, 8 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 811. Up to 32 conditions per place. [2023-11-29 00:48:34,841 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2023-11-29 00:48:34,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 305 transitions, 679 flow [2023-11-29 00:48:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-11-29 00:48:34,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2023-11-29 00:48:34,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-11-29 00:48:34,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-11-29 00:48:34,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:34,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-11-29 00:48:34,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,854 INFO L175 Difference]: Start difference. First operand has 303 places, 304 transitions, 649 flow. Second operand 3 states and 992 transitions. [2023-11-29 00:48:34,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 305 transitions, 679 flow [2023-11-29 00:48:34,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:34,861 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 651 flow [2023-11-29 00:48:34,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2023-11-29 00:48:34,863 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -9 predicate places. [2023-11-29 00:48:34,863 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 651 flow [2023-11-29 00:48:34,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:34,864 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] [2023-11-29 00:48:34,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:48:34,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:34,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1966711615, now seen corresponding path program 1 times [2023-11-29 00:48:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407538701] [2023-11-29 00:48:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407538701] [2023-11-29 00:48:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407538701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247690004] [2023-11-29 00:48:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:34,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:34,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:34,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 346 [2023-11-29 00:48:34,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:34,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:34,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 346 [2023-11-29 00:48:34,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:35,175 INFO L124 PetriNetUnfolderBase]: 43/1173 cut-off events. [2023-11-29 00:48:35,175 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2023-11-29 00:48:35,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 1173 events. 43/1173 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7576 event pairs, 6 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 1143. Up to 64 conditions per place. [2023-11-29 00:48:35,190 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2023-11-29 00:48:35,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 702 flow [2023-11-29 00:48:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2023-11-29 00:48:35,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9585741811175337 [2023-11-29 00:48:35,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 995 transitions. [2023-11-29 00:48:35,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 995 transitions. [2023-11-29 00:48:35,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:35,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 995 transitions. [2023-11-29 00:48:35,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,201 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 651 flow. Second operand 3 states and 995 transitions. [2023-11-29 00:48:35,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 702 flow [2023-11-29 00:48:35,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:35,209 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 657 flow [2023-11-29 00:48:35,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2023-11-29 00:48:35,210 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -10 predicate places. [2023-11-29 00:48:35,210 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 657 flow [2023-11-29 00:48:35,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:35,211 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] [2023-11-29 00:48:35,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:48:35,212 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:35,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1209187, now seen corresponding path program 1 times [2023-11-29 00:48:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:35,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104335346] [2023-11-29 00:48:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:35,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:35,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104335346] [2023-11-29 00:48:35,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104335346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:35,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147186738] [2023-11-29 00:48:35,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:35,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:35,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 346 [2023-11-29 00:48:35,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:35,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 346 [2023-11-29 00:48:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:35,829 INFO L124 PetriNetUnfolderBase]: 232/3021 cut-off events. [2023-11-29 00:48:35,829 INFO L125 PetriNetUnfolderBase]: For 74/214 co-relation queries the response was YES. [2023-11-29 00:48:35,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 3021 events. 232/3021 cut-off events. For 74/214 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 28137 event pairs, 106 based on Foata normal form. 0/2656 useless extension candidates. Maximal degree in co-relation 3005. Up to 336 conditions per place. [2023-11-29 00:48:35,866 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 17 selfloop transitions, 4 changer transitions 0/305 dead transitions. [2023-11-29 00:48:35,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 305 transitions, 705 flow [2023-11-29 00:48:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2023-11-29 00:48:35,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9460500963391136 [2023-11-29 00:48:35,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2023-11-29 00:48:35,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2023-11-29 00:48:35,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:35,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2023-11-29 00:48:35,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,878 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 657 flow. Second operand 3 states and 982 transitions. [2023-11-29 00:48:35,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 305 transitions, 705 flow [2023-11-29 00:48:35,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 305 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:35,885 INFO L231 Difference]: Finished difference. Result has 302 places, 303 transitions, 677 flow [2023-11-29 00:48:35,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=302, PETRI_TRANSITIONS=303} [2023-11-29 00:48:35,887 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:35,887 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 677 flow [2023-11-29 00:48:35,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:35,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:35,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:48:35,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:35,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 257131300, now seen corresponding path program 1 times [2023-11-29 00:48:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:35,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362426919] [2023-11-29 00:48:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:35,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-29 00:48:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362426919] [2023-11-29 00:48:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362426919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966626575] [2023-11-29 00:48:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:35,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 346 [2023-11-29 00:48:35,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 303 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:35,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:35,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 346 [2023-11-29 00:48:35,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:36,464 INFO L124 PetriNetUnfolderBase]: 115/2680 cut-off events. [2023-11-29 00:48:36,465 INFO L125 PetriNetUnfolderBase]: For 42/46 co-relation queries the response was YES. [2023-11-29 00:48:36,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 2680 events. 115/2680 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 23638 event pairs, 16 based on Foata normal form. 0/2419 useless extension candidates. Maximal degree in co-relation 2550. Up to 168 conditions per place. [2023-11-29 00:48:36,489 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2023-11-29 00:48:36,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 307 transitions, 723 flow [2023-11-29 00:48:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-11-29 00:48:36,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9576107899807321 [2023-11-29 00:48:36,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-11-29 00:48:36,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-11-29 00:48:36,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:36,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-11-29 00:48:36,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:36,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:36,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:36,501 INFO L175 Difference]: Start difference. First operand has 302 places, 303 transitions, 677 flow. Second operand 3 states and 994 transitions. [2023-11-29 00:48:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 307 transitions, 723 flow [2023-11-29 00:48:36,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 307 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:36,510 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 687 flow [2023-11-29 00:48:36,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2023-11-29 00:48:36,511 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -10 predicate places. [2023-11-29 00:48:36,511 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 687 flow [2023-11-29 00:48:36,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:36,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:36,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:36,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:48:36,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:36,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1862616738, now seen corresponding path program 1 times [2023-11-29 00:48:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400938179] [2023-11-29 00:48:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:36,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:36,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400938179] [2023-11-29 00:48:36,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400938179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:36,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:36,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561170232] [2023-11-29 00:48:36,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:36,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:36,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:36,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:36,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 346 [2023-11-29 00:48:36,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:36,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:36,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 346 [2023-11-29 00:48:36,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:36,981 INFO L124 PetriNetUnfolderBase]: 108/2432 cut-off events. [2023-11-29 00:48:36,981 INFO L125 PetriNetUnfolderBase]: For 29/62 co-relation queries the response was YES. [2023-11-29 00:48:36,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 2432 events. 108/2432 cut-off events. For 29/62 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 21139 event pairs, 22 based on Foata normal form. 2/2203 useless extension candidates. Maximal degree in co-relation 2332. Up to 80 conditions per place. [2023-11-29 00:48:36,997 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2023-11-29 00:48:36,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 717 flow [2023-11-29 00:48:36,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-11-29 00:48:37,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2023-11-29 00:48:37,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-11-29 00:48:37,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-11-29 00:48:37,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:37,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-11-29 00:48:37,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,007 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 687 flow. Second operand 3 states and 992 transitions. [2023-11-29 00:48:37,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 717 flow [2023-11-29 00:48:37,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 304 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:48:37,013 INFO L231 Difference]: Finished difference. Result has 304 places, 302 transitions, 689 flow [2023-11-29 00:48:37,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=304, PETRI_TRANSITIONS=302} [2023-11-29 00:48:37,014 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -9 predicate places. [2023-11-29 00:48:37,014 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 302 transitions, 689 flow [2023-11-29 00:48:37,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:37,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:37,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:48:37,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:37,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1678163499, now seen corresponding path program 1 times [2023-11-29 00:48:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189390588] [2023-11-29 00:48:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:37,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189390588] [2023-11-29 00:48:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189390588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:37,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:37,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:48:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798908747] [2023-11-29 00:48:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:37,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:48:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:48:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:48:37,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 346 [2023-11-29 00:48:37,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 302 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:37,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 346 [2023-11-29 00:48:37,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:37,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] thread3EXIT-->L77-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][285], [370#(= |#race~length_0~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 387#true, 399#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), Black: 392#true, Black: 397#true, Black: 368#true, 389#(= |#race~to_int_3~0| 0), 380#(= |#race~to_int_1~0| 0), Black: 373#true, 64#L77-7true, 402#true, Black: 378#true, 375#(= |#race~length_2~0| 0)]) [2023-11-29 00:48:37,818 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is not cut-off event [2023-11-29 00:48:37,819 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:37,819 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is not cut-off event [2023-11-29 00:48:37,819 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:37,821 INFO L124 PetriNetUnfolderBase]: 51/1528 cut-off events. [2023-11-29 00:48:37,821 INFO L125 PetriNetUnfolderBase]: For 13/27 co-relation queries the response was YES. [2023-11-29 00:48:37,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1528 events. 51/1528 cut-off events. For 13/27 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11161 event pairs, 0 based on Foata normal form. 8/1390 useless extension candidates. Maximal degree in co-relation 1520. Up to 42 conditions per place. [2023-11-29 00:48:37,837 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 9 selfloop transitions, 4 changer transitions 0/301 dead transitions. [2023-11-29 00:48:37,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 301 transitions, 713 flow [2023-11-29 00:48:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:48:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:48:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1946 transitions. [2023-11-29 00:48:37,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373795761078998 [2023-11-29 00:48:37,844 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1946 transitions. [2023-11-29 00:48:37,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1946 transitions. [2023-11-29 00:48:37,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:37,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1946 transitions. [2023-11-29 00:48:37,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.3333333333333) internal successors, (1946), 6 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,857 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,857 INFO L175 Difference]: Start difference. First operand has 304 places, 302 transitions, 689 flow. Second operand 6 states and 1946 transitions. [2023-11-29 00:48:37,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 301 transitions, 713 flow [2023-11-29 00:48:37,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 301 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:37,865 INFO L231 Difference]: Finished difference. Result has 306 places, 301 transitions, 691 flow [2023-11-29 00:48:37,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=301, 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=691, PETRI_PLACES=306, PETRI_TRANSITIONS=301} [2023-11-29 00:48:37,866 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -7 predicate places. [2023-11-29 00:48:37,866 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 301 transitions, 691 flow [2023-11-29 00:48:37,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.6666666666667) internal successors, (1942), 6 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:37,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:48:37,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:48:37,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:37,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1772142143, now seen corresponding path program 1 times [2023-11-29 00:48:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949736285] [2023-11-29 00:48:37,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949736285] [2023-11-29 00:48:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949736285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977798863] [2023-11-29 00:48:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:37,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:37,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:37,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:37,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 346 [2023-11-29 00:48:37,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 301 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:37,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:37,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 346 [2023-11-29 00:48:37,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:38,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([892] L55-25-->L55-26: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][187], [370#(= |#race~length_0~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 387#true, 399#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), Black: 392#true, Black: 397#true, 27#L55-26true, 101#L76-7true, Black: 368#true, 389#(= |#race~to_int_3~0| 0), 380#(= |#race~to_int_1~0| 0), Black: 373#true, 413#true, Black: 378#true, 375#(= |#race~length_2~0| 0)]) [2023-11-29 00:48:38,262 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2023-11-29 00:48:38,262 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-29 00:48:38,262 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2023-11-29 00:48:38,262 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-29 00:48:38,270 INFO L124 PetriNetUnfolderBase]: 136/1858 cut-off events. [2023-11-29 00:48:38,271 INFO L125 PetriNetUnfolderBase]: For 95/106 co-relation queries the response was YES. [2023-11-29 00:48:38,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 1858 events. 136/1858 cut-off events. For 95/106 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 15332 event pairs, 36 based on Foata normal form. 1/1695 useless extension candidates. Maximal degree in co-relation 2211. Up to 160 conditions per place. [2023-11-29 00:48:38,286 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2023-11-29 00:48:38,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 302 transitions, 721 flow [2023-11-29 00:48:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-11-29 00:48:38,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556840077071291 [2023-11-29 00:48:38,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-11-29 00:48:38,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-11-29 00:48:38,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:38,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-11-29 00:48:38,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:38,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:38,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:38,295 INFO L175 Difference]: Start difference. First operand has 306 places, 301 transitions, 691 flow. Second operand 3 states and 992 transitions. [2023-11-29 00:48:38,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 302 transitions, 721 flow [2023-11-29 00:48:38,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 714 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:48:38,302 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 686 flow [2023-11-29 00:48:38,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2023-11-29 00:48:38,303 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -10 predicate places. [2023-11-29 00:48:38,303 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 686 flow [2023-11-29 00:48:38,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:38,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:38,304 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] [2023-11-29 00:48:38,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:48:38,304 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:38,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2062293989, now seen corresponding path program 1 times [2023-11-29 00:48:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095796099] [2023-11-29 00:48:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095796099] [2023-11-29 00:48:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095796099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:48:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946554794] [2023-11-29 00:48:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:38,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:48:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:38,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:48:38,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:48:39,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 346 [2023-11-29 00:48:39,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 323.8333333333333) internal successors, (1943), 6 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:39,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 346 [2023-11-29 00:48:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:39,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] thread3EXIT-->L77-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][283], [370#(= |#race~length_0~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 387#true, 399#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 392#true, Black: 397#true, Black: 368#true, 389#(= |#race~to_int_3~0| 0), 380#(= |#race~to_int_1~0| 0), Black: 373#true, 64#L77-7true, 413#true, Black: 378#true, 375#(= |#race~length_2~0| 0)]) [2023-11-29 00:48:39,301 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is not cut-off event [2023-11-29 00:48:39,301 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:39,302 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is not cut-off event [2023-11-29 00:48:39,302 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:39,303 INFO L124 PetriNetUnfolderBase]: 51/1497 cut-off events. [2023-11-29 00:48:39,303 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2023-11-29 00:48:39,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 1497 events. 51/1497 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10860 event pairs, 0 based on Foata normal form. 4/1386 useless extension candidates. Maximal degree in co-relation 1640. Up to 42 conditions per place. [2023-11-29 00:48:39,312 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 9 selfloop transitions, 4 changer transitions 0/299 dead transitions. [2023-11-29 00:48:39,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 299 transitions, 710 flow [2023-11-29 00:48:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:48:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:48:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1946 transitions. [2023-11-29 00:48:39,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373795761078998 [2023-11-29 00:48:39,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1946 transitions. [2023-11-29 00:48:39,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1946 transitions. [2023-11-29 00:48:39,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:39,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1946 transitions. [2023-11-29 00:48:39,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.3333333333333) internal successors, (1946), 6 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,326 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,326 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 686 flow. Second operand 6 states and 1946 transitions. [2023-11-29 00:48:39,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 299 transitions, 710 flow [2023-11-29 00:48:39,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 299 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:48:39,332 INFO L231 Difference]: Finished difference. Result has 305 places, 299 transitions, 688 flow [2023-11-29 00:48:39,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=305, PETRI_TRANSITIONS=299} [2023-11-29 00:48:39,333 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -8 predicate places. [2023-11-29 00:48:39,333 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 299 transitions, 688 flow [2023-11-29 00:48:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.8333333333333) internal successors, (1943), 6 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:39,334 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] [2023-11-29 00:48:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:48:39,334 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:39,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1868943953, now seen corresponding path program 1 times [2023-11-29 00:48:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829172396] [2023-11-29 00:48:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829172396] [2023-11-29 00:48:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829172396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:48:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873697317] [2023-11-29 00:48:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:39,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:48:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:48:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:48:39,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 346 [2023-11-29 00:48:39,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 299 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:39,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:39,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 346 [2023-11-29 00:48:39,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:40,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] thread3EXIT-->L77-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][282], [370#(= |#race~length_0~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 387#true, 399#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), Black: 392#true, 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 397#true, Black: 368#true, 389#(= |#race~to_int_3~0| 0), 380#(= |#race~to_int_1~0| 0), Black: 373#true, 64#L77-7true, 429#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 378#true, 375#(= |#race~length_2~0| 0)]) [2023-11-29 00:48:40,105 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is not cut-off event [2023-11-29 00:48:40,105 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:40,106 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is not cut-off event [2023-11-29 00:48:40,106 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is not cut-off event [2023-11-29 00:48:40,107 INFO L124 PetriNetUnfolderBase]: 51/1493 cut-off events. [2023-11-29 00:48:40,107 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2023-11-29 00:48:40,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1493 events. 51/1493 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10830 event pairs, 0 based on Foata normal form. 0/1382 useless extension candidates. Maximal degree in co-relation 1596. Up to 42 conditions per place. [2023-11-29 00:48:40,117 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 9 selfloop transitions, 4 changer transitions 0/298 dead transitions. [2023-11-29 00:48:40,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 298 transitions, 712 flow [2023-11-29 00:48:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:48:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:48:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1946 transitions. [2023-11-29 00:48:40,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373795761078998 [2023-11-29 00:48:40,123 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1946 transitions. [2023-11-29 00:48:40,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1946 transitions. [2023-11-29 00:48:40,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:40,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1946 transitions. [2023-11-29 00:48:40,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.3333333333333) internal successors, (1946), 6 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,134 INFO L175 Difference]: Start difference. First operand has 305 places, 299 transitions, 688 flow. Second operand 6 states and 1946 transitions. [2023-11-29 00:48:40,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 298 transitions, 712 flow [2023-11-29 00:48:40,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 298 transitions, 705 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:48:40,141 INFO L231 Difference]: Finished difference. Result has 305 places, 298 transitions, 687 flow [2023-11-29 00:48:40,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=305, PETRI_TRANSITIONS=298} [2023-11-29 00:48:40,142 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -8 predicate places. [2023-11-29 00:48:40,143 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 298 transitions, 687 flow [2023-11-29 00:48:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:40,144 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] [2023-11-29 00:48:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:48:40,144 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:40,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash 613849004, now seen corresponding path program 1 times [2023-11-29 00:48:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574601857] [2023-11-29 00:48:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:40,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574601857] [2023-11-29 00:48:40,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574601857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:40,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:40,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521351969] [2023-11-29 00:48:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:40,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:40,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:40,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:40,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 346 [2023-11-29 00:48:40,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 298 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:40,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 346 [2023-11-29 00:48:40,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:40,545 INFO L124 PetriNetUnfolderBase]: 73/2062 cut-off events. [2023-11-29 00:48:40,545 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2023-11-29 00:48:40,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 2062 events. 73/2062 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16647 event pairs, 4 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 2216. Up to 66 conditions per place. [2023-11-29 00:48:40,557 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 8 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2023-11-29 00:48:40,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 703 flow [2023-11-29 00:48:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-11-29 00:48:40,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9576107899807321 [2023-11-29 00:48:40,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:40,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,565 INFO L175 Difference]: Start difference. First operand has 305 places, 298 transitions, 687 flow. Second operand 3 states and 994 transitions. [2023-11-29 00:48:40,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 703 flow [2023-11-29 00:48:40,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 297 transitions, 696 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:48:40,569 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 680 flow [2023-11-29 00:48:40,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2023-11-29 00:48:40,570 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:40,570 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 680 flow [2023-11-29 00:48:40,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:40,570 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] [2023-11-29 00:48:40,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:48:40,571 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:40,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash -796813175, now seen corresponding path program 1 times [2023-11-29 00:48:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43375705] [2023-11-29 00:48:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43375705] [2023-11-29 00:48:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43375705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:40,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014089748] [2023-11-29 00:48:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:40,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:40,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:40,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 346 [2023-11-29 00:48:40,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:40,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 346 [2023-11-29 00:48:40,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:40,976 INFO L124 PetriNetUnfolderBase]: 70/2255 cut-off events. [2023-11-29 00:48:40,977 INFO L125 PetriNetUnfolderBase]: For 17/29 co-relation queries the response was YES. [2023-11-29 00:48:40,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 2255 events. 70/2255 cut-off events. For 17/29 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 18590 event pairs, 11 based on Foata normal form. 0/2108 useless extension candidates. Maximal degree in co-relation 2468. Up to 67 conditions per place. [2023-11-29 00:48:40,988 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 8 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2023-11-29 00:48:40,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 296 transitions, 696 flow [2023-11-29 00:48:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-11-29 00:48:40,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9576107899807321 [2023-11-29 00:48:40,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:40,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-11-29 00:48:40,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:40,997 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 680 flow. Second operand 3 states and 994 transitions. [2023-11-29 00:48:40,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 296 transitions, 696 flow [2023-11-29 00:48:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:48:41,003 INFO L231 Difference]: Finished difference. Result has 302 places, 296 transitions, 679 flow [2023-11-29 00:48:41,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=302, PETRI_TRANSITIONS=296} [2023-11-29 00:48:41,005 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:41,005 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 296 transitions, 679 flow [2023-11-29 00:48:41,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:48:41,006 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] [2023-11-29 00:48:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:48:41,006 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-29 00:48:41,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:48:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 340827773, now seen corresponding path program 1 times [2023-11-29 00:48:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:48:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340682328] [2023-11-29 00:48:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:48:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:48:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:48:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:48:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:48:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340682328] [2023-11-29 00:48:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340682328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:48:41,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:48:41,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:48:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792378351] [2023-11-29 00:48:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:48:41,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:48:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:48:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:48:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:48:41,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 346 [2023-11-29 00:48:41,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 296 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:48:41,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 346 [2023-11-29 00:48:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:48:41,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L55-26-->L55-27: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_1|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][195], [370#(= |#race~length_0~0| 0), 411#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 387#true, 399#(= |#race~to_int_5~0| 0), 394#(= |#race~length_4~0| 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 392#true, 435#true, Black: 397#true, 101#L76-7true, Black: 368#true, 389#(= |#race~to_int_3~0| 0), 380#(= |#race~to_int_1~0| 0), Black: 373#true, 92#L55-27true, Black: 378#true, 439#true, 375#(= |#race~length_2~0| 0)]) [2023-11-29 00:48:41,323 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2023-11-29 00:48:41,323 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-29 00:48:41,323 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-29 00:48:41,323 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2023-11-29 00:48:41,331 INFO L124 PetriNetUnfolderBase]: 68/1659 cut-off events. [2023-11-29 00:48:41,331 INFO L125 PetriNetUnfolderBase]: For 32/38 co-relation queries the response was YES. [2023-11-29 00:48:41,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1659 events. 68/1659 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 12497 event pairs, 18 based on Foata normal form. 10/1553 useless extension candidates. Maximal degree in co-relation 1901. Up to 87 conditions per place. [2023-11-29 00:48:41,340 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2023-11-29 00:48:41,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 693 flow [2023-11-29 00:48:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:48:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:48:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2023-11-29 00:48:41,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9566473988439307 [2023-11-29 00:48:41,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2023-11-29 00:48:41,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2023-11-29 00:48:41,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:48:41,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2023-11-29 00:48:41,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,347 INFO L175 Difference]: Start difference. First operand has 302 places, 296 transitions, 679 flow. Second operand 3 states and 993 transitions. [2023-11-29 00:48:41,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 693 flow [2023-11-29 00:48:41,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 692 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:48:41,350 INFO L231 Difference]: Finished difference. Result has 302 places, 0 transitions, 0 flow [2023-11-29 00:48:41,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=302, PETRI_TRANSITIONS=0} [2023-11-29 00:48:41,351 INFO L281 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2023-11-29 00:48:41,351 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 0 transitions, 0 flow [2023-11-29 00:48:41,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:48:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-11-29 00:48:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-11-29 00:48:41,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-11-29 00:48:41,356 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2023-11-29 00:48:41,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-11-29 00:48:41,358 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-11-29 00:48:41,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-11-29 00:48:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:48:41,360 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] [2023-11-29 00:48:41,365 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:48:41,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:48:41,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:48:41 BasicIcfg [2023-11-29 00:48:41,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:48:41,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:48:41,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:48:41,370 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:48:41,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:48:31" (3/4) ... [2023-11-29 00:48:41,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:48:41,374 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 00:48:41,374 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 00:48:41,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 00:48:41,380 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-29 00:48:41,380 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 00:48:41,380 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:48:41,381 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:48:41,452 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:48:41,453 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:48:41,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:48:41,454 INFO L158 Benchmark]: Toolchain (without parser) took 10990.38ms. Allocated memory was 117.4MB in the beginning and 484.4MB in the end (delta: 367.0MB). Free memory was 58.6MB in the beginning and 231.2MB in the end (delta: -172.6MB). Peak memory consumption was 196.8MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,454 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:48:41,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 58.5MB in the beginning and 125.0MB in the end (delta: -66.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,455 INFO L158 Benchmark]: Boogie Preprocessor took 40.25ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,456 INFO L158 Benchmark]: RCFGBuilder took 555.63ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 94.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,456 INFO L158 Benchmark]: TraceAbstraction took 9956.15ms. Allocated memory was 159.4MB in the beginning and 484.4MB in the end (delta: 325.1MB). Free memory was 93.5MB in the beginning and 237.5MB in the end (delta: -144.0MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,457 INFO L158 Benchmark]: Witness Printer took 83.27ms. Allocated memory is still 484.4MB. Free memory was 237.5MB in the beginning and 231.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:48:41,458 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.20ms. Allocated memory is still 117.4MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 58.5MB in the beginning and 125.0MB in the end (delta: -66.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.57ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.25ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.63ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 94.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9956.15ms. Allocated memory was 159.4MB in the beginning and 484.4MB in the end (delta: 325.1MB). Free memory was 93.5MB in the beginning and 237.5MB in the end (delta: -144.0MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. * Witness Printer took 83.27ms. Allocated memory is still 484.4MB. Free memory was 237.5MB in the beginning and 231.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 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: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 509 locations, 51 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: 9.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 101 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=15, InterpolantAutomatonStates: 72, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1883 NumberOfCodeBlocks, 1883 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 2141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 00:48:41,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4437dfed-2f19-4a90-81dd-bf8df7ab0f8e/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