./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1 --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 e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:49:05,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:49:05,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-02 15:49:05,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:49:05,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:49:05,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:49:05,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:49:05,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:49:05,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:49:05,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:49:05,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:49:05,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:49:05,227 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:49:05,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:49:05,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:49:05,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:49:05,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:49:05,229 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1 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 -> e58f19518df0581d95f13f906b8c44b8c282310d0c51162e45cefa58addde8de [2024-12-02 15:49:05,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:49:05,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:49:05,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:49:05,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:49:05,475 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:49:05,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2024-12-02 15:49:08,115 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/data/3af5ab8f6/2771045b066d4c56b7f7936c9eb454f8/FLAG17c1a7faa [2024-12-02 15:49:08,366 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:49:08,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid-join.i [2024-12-02 15:49:08,381 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/data/3af5ab8f6/2771045b066d4c56b7f7936c9eb454f8/FLAG17c1a7faa [2024-12-02 15:49:08,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/data/3af5ab8f6/2771045b066d4c56b7f7936c9eb454f8 [2024-12-02 15:49:08,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:49:08,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:49:08,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:49:08,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:49:08,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:49:08,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:49:08" (1/1) ... [2024-12-02 15:49:08,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baf76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:08, skipping insertion in model container [2024-12-02 15:49:08,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:49:08" (1/1) ... [2024-12-02 15:49:08,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:49:09,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:49:09,077 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:49:09,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:49:09,179 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:49:09,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09 WrapperNode [2024-12-02 15:49:09,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:49:09,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:49:09,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:49:09,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:49:09,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,215 INFO L138 Inliner]: procedures = 267, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2024-12-02 15:49:09,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:49:09,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:49:09,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:49:09,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:49:09,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:49:09,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:49:09,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:49:09,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:49:09,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (1/1) ... [2024-12-02 15:49:09,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:49:09,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:49:09,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:49:09,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c4da25-3332-4c84-ad76-a1be3dd01395/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:49:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-02 15:49:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 15:49:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-02 15:49:09,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-12-02 15:49:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-12-02 15:49:09,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:49:09,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:49:09,290 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 15:49:09,392 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:49:09,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:49:09,594 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 15:49:09,594 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:49:09,611 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:49:09,611 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 15:49:09,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:49:09 BoogieIcfgContainer [2024-12-02 15:49:09,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:49:09,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:49:09,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:49:09,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:49:09,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:49:08" (1/3) ... [2024-12-02 15:49:09,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc05e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:49:09, skipping insertion in model container [2024-12-02 15:49:09,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:49:09" (2/3) ... [2024-12-02 15:49:09,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc05e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:49:09, skipping insertion in model container [2024-12-02 15:49:09,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:49:09" (3/3) ... [2024-12-02 15:49:09,620 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid-join.i [2024-12-02 15:49:09,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:49:09,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid-join.i that has 2 procedures, 117 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2024-12-02 15:49:09,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 15:49:09,691 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-02 15:49:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 121 transitions, 249 flow [2024-12-02 15:49:09,802 INFO L124 PetriNetUnfolderBase]: 6/174 cut-off events. [2024-12-02 15:49:09,804 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-02 15:49:09,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 6/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 247 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2024-12-02 15:49:09,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 121 transitions, 249 flow [2024-12-02 15:49:09,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 249 flow [2024-12-02 15:49:09,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:49:09,826 INFO L333 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, 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;@4362ec57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:49:09,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-12-02 15:49:09,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:49:09,837 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-12-02 15:49:09,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:49:09,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:09,838 INFO L206 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] [2024-12-02 15:49:09,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:09,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2126740863, now seen corresponding path program 1 times [2024-12-02 15:49:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148680360] [2024-12-02 15:49:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148680360] [2024-12-02 15:49:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148680360] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812892061] [2024-12-02 15:49:10,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:10,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:10,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:10,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:10,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 121 [2024-12-02 15:49:10,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:10,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:10,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 121 [2024-12-02 15:49:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:10,142 INFO L124 PetriNetUnfolderBase]: 8/212 cut-off events. [2024-12-02 15:49:10,143 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2024-12-02 15:49:10,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 212 events. 8/212 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 531 event pairs, 1 based on Foata normal form. 8/197 useless extension candidates. Maximal degree in co-relation 142. Up to 16 conditions per place. [2024-12-02 15:49:10,145 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 8 selfloop transitions, 3 changer transitions 2/122 dead transitions. [2024-12-02 15:49:10,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 275 flow [2024-12-02 15:49:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-12-02 15:49:10,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953168044077135 [2024-12-02 15:49:10,160 INFO L175 Difference]: Start difference. First operand has 120 places, 121 transitions, 249 flow. Second operand 3 states and 346 transitions. [2024-12-02 15:49:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 275 flow [2024-12-02 15:49:10,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 15:49:10,169 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 263 flow [2024-12-02 15:49:10,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2024-12-02 15:49:10,175 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2024-12-02 15:49:10,175 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 263 flow [2024-12-02 15:49:10,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:10,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:10,175 INFO L206 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] [2024-12-02 15:49:10,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 15:49:10,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:10,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1891615512, now seen corresponding path program 1 times [2024-12-02 15:49:10,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042842366] [2024-12-02 15:49:10,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042842366] [2024-12-02 15:49:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042842366] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:10,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477561294] [2024-12-02 15:49:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:10,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:10,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:10,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:10,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121 [2024-12-02 15:49:10,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:10,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:10,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121 [2024-12-02 15:49:10,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:10,594 INFO L124 PetriNetUnfolderBase]: 17/323 cut-off events. [2024-12-02 15:49:10,594 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-12-02 15:49:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 323 events. 17/323 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1142 event pairs, 1 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 311. Up to 49 conditions per place. [2024-12-02 15:49:10,596 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 15 selfloop transitions, 2 changer transitions 5/126 dead transitions. [2024-12-02 15:49:10,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 126 transitions, 321 flow [2024-12-02 15:49:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2024-12-02 15:49:10,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829201101928374 [2024-12-02 15:49:10,600 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 263 flow. Second operand 6 states and 641 transitions. [2024-12-02 15:49:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 126 transitions, 321 flow [2024-12-02 15:49:10,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:10,603 INFO L231 Difference]: Finished difference. Result has 130 places, 119 transitions, 275 flow [2024-12-02 15:49:10,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=130, PETRI_TRANSITIONS=119} [2024-12-02 15:49:10,604 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2024-12-02 15:49:10,604 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 119 transitions, 275 flow [2024-12-02 15:49:10,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:10,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:10,605 INFO L206 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] [2024-12-02 15:49:10,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 15:49:10,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 46886871, now seen corresponding path program 1 times [2024-12-02 15:49:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697986651] [2024-12-02 15:49:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:11,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:11,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697986651] [2024-12-02 15:49:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697986651] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:11,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:11,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018483272] [2024-12-02 15:49:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:11,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:11,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:11,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:11,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121 [2024-12-02 15:49:11,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 119 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:11,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:11,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121 [2024-12-02 15:49:11,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:11,365 INFO L124 PetriNetUnfolderBase]: 46/420 cut-off events. [2024-12-02 15:49:11,365 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-12-02 15:49:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 420 events. 46/420 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1892 event pairs, 35 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2024-12-02 15:49:11,368 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 36 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2024-12-02 15:49:11,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 371 flow [2024-12-02 15:49:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2024-12-02 15:49:11,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7520661157024794 [2024-12-02 15:49:11,370 INFO L175 Difference]: Start difference. First operand has 130 places, 119 transitions, 275 flow. Second operand 6 states and 546 transitions. [2024-12-02 15:49:11,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 371 flow [2024-12-02 15:49:11,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 357 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:11,374 INFO L231 Difference]: Finished difference. Result has 126 places, 118 transitions, 269 flow [2024-12-02 15:49:11,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=126, PETRI_TRANSITIONS=118} [2024-12-02 15:49:11,375 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 6 predicate places. [2024-12-02 15:49:11,375 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 118 transitions, 269 flow [2024-12-02 15:49:11,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:11,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:11,376 INFO L206 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] [2024-12-02 15:49:11,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 15:49:11,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:11,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash 390301768, now seen corresponding path program 1 times [2024-12-02 15:49:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761988639] [2024-12-02 15:49:11,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:11,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761988639] [2024-12-02 15:49:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761988639] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:11,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062954780] [2024-12-02 15:49:11,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:11,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:11,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:11,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:11,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 121 [2024-12-02 15:49:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:11,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:11,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 121 [2024-12-02 15:49:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:11,934 INFO L124 PetriNetUnfolderBase]: 46/346 cut-off events. [2024-12-02 15:49:11,934 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-02 15:49:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 346 events. 46/346 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1567 event pairs, 19 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 407. Up to 112 conditions per place. [2024-12-02 15:49:11,937 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 34 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2024-12-02 15:49:11,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2024-12-02 15:49:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-12-02 15:49:11,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7658402203856749 [2024-12-02 15:49:11,939 INFO L175 Difference]: Start difference. First operand has 126 places, 118 transitions, 269 flow. Second operand 6 states and 556 transitions. [2024-12-02 15:49:11,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2024-12-02 15:49:11,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 125 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:11,943 INFO L231 Difference]: Finished difference. Result has 125 places, 117 transitions, 267 flow [2024-12-02 15:49:11,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=125, PETRI_TRANSITIONS=117} [2024-12-02 15:49:11,944 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2024-12-02 15:49:11,944 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 117 transitions, 267 flow [2024-12-02 15:49:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:11,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:11,945 INFO L206 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] [2024-12-02 15:49:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 15:49:11,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:11,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1378642276, now seen corresponding path program 1 times [2024-12-02 15:49:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706776962] [2024-12-02 15:49:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:11,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706776962] [2024-12-02 15:49:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706776962] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80837619] [2024-12-02 15:49:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:12,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 121 [2024-12-02 15:49:12,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:12,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:12,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 121 [2024-12-02 15:49:12,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:12,040 INFO L124 PetriNetUnfolderBase]: 5/216 cut-off events. [2024-12-02 15:49:12,041 INFO L125 PetriNetUnfolderBase]: For 18/31 co-relation queries the response was YES. [2024-12-02 15:49:12,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 216 events. 5/216 cut-off events. For 18/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 599 event pairs, 3 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 212. Up to 25 conditions per place. [2024-12-02 15:49:12,041 INFO L140 encePairwiseOnDemand]: 116/121 looper letters, 8 selfloop transitions, 4 changer transitions 3/120 dead transitions. [2024-12-02 15:49:12,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 120 transitions, 303 flow [2024-12-02 15:49:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-12-02 15:49:12,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2024-12-02 15:49:12,043 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 267 flow. Second operand 3 states and 338 transitions. [2024-12-02 15:49:12,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 120 transitions, 303 flow [2024-12-02 15:49:12,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 293 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:12,046 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 279 flow [2024-12-02 15:49:12,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-12-02 15:49:12,047 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2024-12-02 15:49:12,047 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 279 flow [2024-12-02 15:49:12,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:12,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:12,048 INFO L206 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] [2024-12-02 15:49:12,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 15:49:12,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash 77844812, now seen corresponding path program 1 times [2024-12-02 15:49:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:12,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041762043] [2024-12-02 15:49:12,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:12,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 15:49:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041762043] [2024-12-02 15:49:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041762043] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:12,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:12,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921821359] [2024-12-02 15:49:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:12,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:12,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:12,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:12,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2024-12-02 15:49:12,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:12,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:12,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2024-12-02 15:49:12,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:12,784 INFO L124 PetriNetUnfolderBase]: 33/406 cut-off events. [2024-12-02 15:49:12,784 INFO L125 PetriNetUnfolderBase]: For 66/69 co-relation queries the response was YES. [2024-12-02 15:49:12,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 406 events. 33/406 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1839 event pairs, 23 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 511. Up to 79 conditions per place. [2024-12-02 15:49:12,786 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 31 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2024-12-02 15:49:12,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 363 flow [2024-12-02 15:49:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 566 transitions. [2024-12-02 15:49:12,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7796143250688705 [2024-12-02 15:49:12,788 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 279 flow. Second operand 6 states and 566 transitions. [2024-12-02 15:49:12,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 363 flow [2024-12-02 15:49:12,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:12,792 INFO L231 Difference]: Finished difference. Result has 125 places, 115 transitions, 277 flow [2024-12-02 15:49:12,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=125, PETRI_TRANSITIONS=115} [2024-12-02 15:49:12,792 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2024-12-02 15:49:12,792 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 115 transitions, 277 flow [2024-12-02 15:49:12,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:12,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:12,793 INFO L206 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] [2024-12-02 15:49:12,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 15:49:12,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:12,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1957010532, now seen corresponding path program 1 times [2024-12-02 15:49:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:12,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334536581] [2024-12-02 15:49:12,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 15:49:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334536581] [2024-12-02 15:49:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334536581] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:49:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171846486] [2024-12-02 15:49:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:12,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:13,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 121 [2024-12-02 15:49:13,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 121 [2024-12-02 15:49:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:13,075 INFO L124 PetriNetUnfolderBase]: 10/238 cut-off events. [2024-12-02 15:49:13,075 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-12-02 15:49:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 238 events. 10/238 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 582 event pairs, 0 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 209. Up to 23 conditions per place. [2024-12-02 15:49:13,076 INFO L140 encePairwiseOnDemand]: 114/121 looper letters, 13 selfloop transitions, 5 changer transitions 9/116 dead transitions. [2024-12-02 15:49:13,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 116 transitions, 309 flow [2024-12-02 15:49:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2024-12-02 15:49:13,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732782369146006 [2024-12-02 15:49:13,079 INFO L175 Difference]: Start difference. First operand has 125 places, 115 transitions, 277 flow. Second operand 6 states and 634 transitions. [2024-12-02 15:49:13,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 116 transitions, 309 flow [2024-12-02 15:49:13,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 285 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-12-02 15:49:13,081 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 231 flow [2024-12-02 15:49:13,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-12-02 15:49:13,082 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2024-12-02 15:49:13,082 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 231 flow [2024-12-02 15:49:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:13,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:13,082 INFO L206 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] [2024-12-02 15:49:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 15:49:13,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -193606468, now seen corresponding path program 1 times [2024-12-02 15:49:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400257680] [2024-12-02 15:49:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 15:49:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400257680] [2024-12-02 15:49:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400257680] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:13,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270788805] [2024-12-02 15:49:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:13,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:13,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:13,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:13,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2024-12-02 15:49:13,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 103 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:13,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:13,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2024-12-02 15:49:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:13,688 INFO L124 PetriNetUnfolderBase]: 28/299 cut-off events. [2024-12-02 15:49:13,688 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-12-02 15:49:13,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 299 events. 28/299 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1050 event pairs, 18 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 60 conditions per place. [2024-12-02 15:49:13,689 INFO L140 encePairwiseOnDemand]: 115/121 looper letters, 12 selfloop transitions, 0 changer transitions 38/110 dead transitions. [2024-12-02 15:49:13,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 301 flow [2024-12-02 15:49:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2024-12-02 15:49:13,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-12-02 15:49:13,691 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 231 flow. Second operand 6 states and 605 transitions. [2024-12-02 15:49:13,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 301 flow [2024-12-02 15:49:13,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 293 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 15:49:13,693 INFO L231 Difference]: Finished difference. Result has 111 places, 72 transitions, 156 flow [2024-12-02 15:49:13,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=111, PETRI_TRANSITIONS=72} [2024-12-02 15:49:13,694 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -9 predicate places. [2024-12-02 15:49:13,694 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 72 transitions, 156 flow [2024-12-02 15:49:13,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:13,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:13,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 15:49:13,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-12-02 15:49:13,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 889299035, now seen corresponding path program 1 times [2024-12-02 15:49:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236326661] [2024-12-02 15:49:13,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:13,729 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:49:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:13,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:49:13,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:49:13,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-12-02 15:49:13,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-12-02 15:49:13,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-12-02 15:49:13,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-12-02 15:49:13,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 15:49:13,774 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:13,776 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 15:49:13,776 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-02 15:49:13,796 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-02 15:49:13,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 294 flow [2024-12-02 15:49:13,834 INFO L124 PetriNetUnfolderBase]: 11/308 cut-off events. [2024-12-02 15:49:13,834 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-12-02 15:49:13,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 308 events. 11/308 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 579 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 176. Up to 8 conditions per place. [2024-12-02 15:49:13,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 294 flow [2024-12-02 15:49:13,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 294 flow [2024-12-02 15:49:13,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:49:13,837 INFO L333 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, 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;@4362ec57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:49:13,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-12-02 15:49:13,841 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:49:13,841 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-12-02 15:49:13,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:49:13,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:13,841 INFO L206 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] [2024-12-02 15:49:13,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:13,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1716185569, now seen corresponding path program 1 times [2024-12-02 15:49:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846635749] [2024-12-02 15:49:13,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846635749] [2024-12-02 15:49:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846635749] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073636426] [2024-12-02 15:49:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:13,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:13,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:13,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:13,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 139 [2024-12-02 15:49:13,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:13,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:13,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 139 [2024-12-02 15:49:13,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:14,012 INFO L124 PetriNetUnfolderBase]: 119/878 cut-off events. [2024-12-02 15:49:14,012 INFO L125 PetriNetUnfolderBase]: For 72/115 co-relation queries the response was YES. [2024-12-02 15:49:14,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 878 events. 119/878 cut-off events. For 72/115 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4785 event pairs, 50 based on Foata normal form. 36/808 useless extension candidates. Maximal degree in co-relation 837. Up to 139 conditions per place. [2024-12-02 15:49:14,017 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 16 selfloop transitions, 4 changer transitions 1/143 dead transitions. [2024-12-02 15:49:14,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 143 transitions, 342 flow [2024-12-02 15:49:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-12-02 15:49:14,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424460431654677 [2024-12-02 15:49:14,018 INFO L175 Difference]: Start difference. First operand has 139 places, 139 transitions, 294 flow. Second operand 3 states and 393 transitions. [2024-12-02 15:49:14,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 143 transitions, 342 flow [2024-12-02 15:49:14,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 15:49:14,032 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 316 flow [2024-12-02 15:49:14,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2024-12-02 15:49:14,033 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2024-12-02 15:49:14,033 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 316 flow [2024-12-02 15:49:14,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:14,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:14,034 INFO L206 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] [2024-12-02 15:49:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 15:49:14,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1783782824, now seen corresponding path program 1 times [2024-12-02 15:49:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166169133] [2024-12-02 15:49:14,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166169133] [2024-12-02 15:49:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166169133] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:14,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:14,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:14,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870635498] [2024-12-02 15:49:14,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:14,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:14,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:14,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:14,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 139 [2024-12-02 15:49:14,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:14,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:14,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 139 [2024-12-02 15:49:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:14,405 INFO L124 PetriNetUnfolderBase]: 189/1374 cut-off events. [2024-12-02 15:49:14,405 INFO L125 PetriNetUnfolderBase]: For 72/73 co-relation queries the response was YES. [2024-12-02 15:49:14,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 1374 events. 189/1374 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9510 event pairs, 131 based on Foata normal form. 1/1256 useless extension candidates. Maximal degree in co-relation 1273. Up to 314 conditions per place. [2024-12-02 15:49:14,412 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 20 selfloop transitions, 2 changer transitions 5/146 dead transitions. [2024-12-02 15:49:14,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 386 flow [2024-12-02 15:49:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2024-12-02 15:49:14,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752997601918465 [2024-12-02 15:49:14,415 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 316 flow. Second operand 6 states and 730 transitions. [2024-12-02 15:49:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 386 flow [2024-12-02 15:49:14,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:14,418 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 330 flow [2024-12-02 15:49:14,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=149, PETRI_TRANSITIONS=139} [2024-12-02 15:49:14,419 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2024-12-02 15:49:14,419 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 330 flow [2024-12-02 15:49:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:14,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:14,420 INFO L206 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] [2024-12-02 15:49:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 15:49:14,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1979881566, now seen corresponding path program 1 times [2024-12-02 15:49:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943922041] [2024-12-02 15:49:14,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:14,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943922041] [2024-12-02 15:49:14,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943922041] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:14,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785297580] [2024-12-02 15:49:14,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:14,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:14,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:14,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:14,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 139 [2024-12-02 15:49:14,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:14,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:14,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 139 [2024-12-02 15:49:14,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:15,210 INFO L124 PetriNetUnfolderBase]: 448/2416 cut-off events. [2024-12-02 15:49:15,210 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-12-02 15:49:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 2416 events. 448/2416 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19993 event pairs, 342 based on Foata normal form. 0/2149 useless extension candidates. Maximal degree in co-relation 3409. Up to 657 conditions per place. [2024-12-02 15:49:15,230 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 49 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2024-12-02 15:49:15,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 154 transitions, 468 flow [2024-12-02 15:49:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2024-12-02 15:49:15,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7697841726618705 [2024-12-02 15:49:15,233 INFO L175 Difference]: Start difference. First operand has 149 places, 139 transitions, 330 flow. Second operand 6 states and 642 transitions. [2024-12-02 15:49:15,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 154 transitions, 468 flow [2024-12-02 15:49:15,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 154 transitions, 456 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 15:49:15,238 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 326 flow [2024-12-02 15:49:15,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2024-12-02 15:49:15,239 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2024-12-02 15:49:15,239 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 326 flow [2024-12-02 15:49:15,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:15,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:15,240 INFO L206 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] [2024-12-02 15:49:15,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 15:49:15,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 158229811, now seen corresponding path program 1 times [2024-12-02 15:49:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149877126] [2024-12-02 15:49:15,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149877126] [2024-12-02 15:49:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149877126] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:15,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114080644] [2024-12-02 15:49:15,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:15,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:15,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:15,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 139 [2024-12-02 15:49:15,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:15,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:15,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 139 [2024-12-02 15:49:15,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:16,044 INFO L124 PetriNetUnfolderBase]: 446/2418 cut-off events. [2024-12-02 15:49:16,044 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-12-02 15:49:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3494 conditions, 2418 events. 446/2418 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 20003 event pairs, 264 based on Foata normal form. 0/2139 useless extension candidates. Maximal degree in co-relation 2137. Up to 633 conditions per place. [2024-12-02 15:49:16,057 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 46 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2024-12-02 15:49:16,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 458 flow [2024-12-02 15:49:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2024-12-02 15:49:16,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7817745803357314 [2024-12-02 15:49:16,060 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 326 flow. Second operand 6 states and 652 transitions. [2024-12-02 15:49:16,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 458 flow [2024-12-02 15:49:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 448 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:16,063 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 324 flow [2024-12-02 15:49:16,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2024-12-02 15:49:16,064 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2024-12-02 15:49:16,064 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 324 flow [2024-12-02 15:49:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:16,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:16,064 INFO L206 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] [2024-12-02 15:49:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 15:49:16,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 705331863, now seen corresponding path program 1 times [2024-12-02 15:49:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330345916] [2024-12-02 15:49:16,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330345916] [2024-12-02 15:49:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330345916] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278831558] [2024-12-02 15:49:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:16,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:16,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:16,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:16,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-12-02 15:49:16,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:16,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:16,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-12-02 15:49:16,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:16,266 INFO L124 PetriNetUnfolderBase]: 165/1189 cut-off events. [2024-12-02 15:49:16,266 INFO L125 PetriNetUnfolderBase]: For 192/359 co-relation queries the response was YES. [2024-12-02 15:49:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 1189 events. 165/1189 cut-off events. For 192/359 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8133 event pairs, 88 based on Foata normal form. 3/1059 useless extension candidates. Maximal degree in co-relation 1425. Up to 269 conditions per place. [2024-12-02 15:49:16,273 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 19 selfloop transitions, 7 changer transitions 0/146 dead transitions. [2024-12-02 15:49:16,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 408 flow [2024-12-02 15:49:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2024-12-02 15:49:16,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9280575539568345 [2024-12-02 15:49:16,275 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 324 flow. Second operand 3 states and 387 transitions. [2024-12-02 15:49:16,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 408 flow [2024-12-02 15:49:16,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 398 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:16,287 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 370 flow [2024-12-02 15:49:16,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2024-12-02 15:49:16,288 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2024-12-02 15:49:16,288 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 370 flow [2024-12-02 15:49:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:16,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:16,288 INFO L206 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] [2024-12-02 15:49:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 15:49:16,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash 825739207, now seen corresponding path program 1 times [2024-12-02 15:49:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230007958] [2024-12-02 15:49:16,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230007958] [2024-12-02 15:49:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230007958] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:16,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33902815] [2024-12-02 15:49:16,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:16,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:16,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:16,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:16,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 139 [2024-12-02 15:49:16,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:16,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:16,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 139 [2024-12-02 15:49:16,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:17,142 INFO L124 PetriNetUnfolderBase]: 463/2595 cut-off events. [2024-12-02 15:49:17,142 INFO L125 PetriNetUnfolderBase]: For 408/466 co-relation queries the response was YES. [2024-12-02 15:49:17,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 2595 events. 463/2595 cut-off events. For 408/466 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 22437 event pairs, 251 based on Foata normal form. 3/2378 useless extension candidates. Maximal degree in co-relation 3254. Up to 490 conditions per place. [2024-12-02 15:49:17,158 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 43 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2024-12-02 15:49:17,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 494 flow [2024-12-02 15:49:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 662 transitions. [2024-12-02 15:49:17,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7937649880095923 [2024-12-02 15:49:17,161 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 370 flow. Second operand 6 states and 662 transitions. [2024-12-02 15:49:17,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 494 flow [2024-12-02 15:49:17,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 156 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:17,167 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 362 flow [2024-12-02 15:49:17,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2024-12-02 15:49:17,168 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2024-12-02 15:49:17,168 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 362 flow [2024-12-02 15:49:17,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:17,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:17,169 INFO L206 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] [2024-12-02 15:49:17,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 15:49:17,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1515585015, now seen corresponding path program 1 times [2024-12-02 15:49:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:17,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562052264] [2024-12-02 15:49:17,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:17,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:49:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:17,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562052264] [2024-12-02 15:49:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562052264] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:49:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414322705] [2024-12-02 15:49:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:17,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:17,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:17,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2024-12-02 15:49:17,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:17,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:17,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2024-12-02 15:49:17,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:17,539 INFO L124 PetriNetUnfolderBase]: 145/1371 cut-off events. [2024-12-02 15:49:17,540 INFO L125 PetriNetUnfolderBase]: For 142/170 co-relation queries the response was YES. [2024-12-02 15:49:17,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 1371 events. 145/1371 cut-off events. For 142/170 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 9362 event pairs, 75 based on Foata normal form. 15/1306 useless extension candidates. Maximal degree in co-relation 1061. Up to 195 conditions per place. [2024-12-02 15:49:17,547 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 26 selfloop transitions, 6 changer transitions 3/153 dead transitions. [2024-12-02 15:49:17,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 153 transitions, 462 flow [2024-12-02 15:49:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2024-12-02 15:49:17,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776978417266187 [2024-12-02 15:49:17,549 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 362 flow. Second operand 6 states and 732 transitions. [2024-12-02 15:49:17,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 153 transitions, 462 flow [2024-12-02 15:49:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:17,552 INFO L231 Difference]: Finished difference. Result has 147 places, 141 transitions, 372 flow [2024-12-02 15:49:17,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=147, PETRI_TRANSITIONS=141} [2024-12-02 15:49:17,553 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2024-12-02 15:49:17,553 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 372 flow [2024-12-02 15:49:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:17,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:17,554 INFO L206 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] [2024-12-02 15:49:17,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 15:49:17,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:17,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1015978217, now seen corresponding path program 1 times [2024-12-02 15:49:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991590230] [2024-12-02 15:49:17,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:49:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:17,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991590230] [2024-12-02 15:49:17,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991590230] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:17,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:17,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900824577] [2024-12-02 15:49:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:17,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:17,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:17,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:17,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:18,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 139 [2024-12-02 15:49:18,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 141 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:18,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 139 [2024-12-02 15:49:18,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:18,216 INFO L124 PetriNetUnfolderBase]: 329/1886 cut-off events. [2024-12-02 15:49:18,216 INFO L125 PetriNetUnfolderBase]: For 141/176 co-relation queries the response was YES. [2024-12-02 15:49:18,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 1886 events. 329/1886 cut-off events. For 141/176 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14562 event pairs, 186 based on Foata normal form. 0/1757 useless extension candidates. Maximal degree in co-relation 2181. Up to 364 conditions per place. [2024-12-02 15:49:18,223 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 36 selfloop transitions, 5 changer transitions 1/156 dead transitions. [2024-12-02 15:49:18,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 156 transitions, 484 flow [2024-12-02 15:49:18,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2024-12-02 15:49:18,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.841726618705036 [2024-12-02 15:49:18,225 INFO L175 Difference]: Start difference. First operand has 147 places, 141 transitions, 372 flow. Second operand 6 states and 702 transitions. [2024-12-02 15:49:18,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 156 transitions, 484 flow [2024-12-02 15:49:18,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 15:49:18,228 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 368 flow [2024-12-02 15:49:18,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2024-12-02 15:49:18,229 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2024-12-02 15:49:18,229 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 368 flow [2024-12-02 15:49:18,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:18,229 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 15:49:18,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -554018041, now seen corresponding path program 1 times [2024-12-02 15:49:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895706711] [2024-12-02 15:49:18,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:49:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895706711] [2024-12-02 15:49:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895706711] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841738361] [2024-12-02 15:49:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:18,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:18,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-12-02 15:49:18,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:18,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-12-02 15:49:18,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:18,374 INFO L124 PetriNetUnfolderBase]: 56/879 cut-off events. [2024-12-02 15:49:18,374 INFO L125 PetriNetUnfolderBase]: For 231/459 co-relation queries the response was YES. [2024-12-02 15:49:18,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 879 events. 56/879 cut-off events. For 231/459 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5313 event pairs, 30 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 1138. Up to 119 conditions per place. [2024-12-02 15:49:18,377 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 19 selfloop transitions, 7 changer transitions 1/146 dead transitions. [2024-12-02 15:49:18,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 445 flow [2024-12-02 15:49:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2024-12-02 15:49:18,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9256594724220624 [2024-12-02 15:49:18,378 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 368 flow. Second operand 3 states and 386 transitions. [2024-12-02 15:49:18,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 445 flow [2024-12-02 15:49:18,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:18,380 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 408 flow [2024-12-02 15:49:18,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2024-12-02 15:49:18,380 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2024-12-02 15:49:18,381 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 408 flow [2024-12-02 15:49:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:18,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:18,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 15:49:18,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:18,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash -146622529, now seen corresponding path program 1 times [2024-12-02 15:49:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477981656] [2024-12-02 15:49:18,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:49:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477981656] [2024-12-02 15:49:18,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477981656] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:18,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:18,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:49:18,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662167199] [2024-12-02 15:49:18,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:18,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:18,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:18,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:18,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 139 [2024-12-02 15:49:18,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:18,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 139 [2024-12-02 15:49:18,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:18,513 INFO L124 PetriNetUnfolderBase]: 12/474 cut-off events. [2024-12-02 15:49:18,513 INFO L125 PetriNetUnfolderBase]: For 119/146 co-relation queries the response was YES. [2024-12-02 15:49:18,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 474 events. 12/474 cut-off events. For 119/146 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1857 event pairs, 5 based on Foata normal form. 4/472 useless extension candidates. Maximal degree in co-relation 510. Up to 25 conditions per place. [2024-12-02 15:49:18,514 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 8 selfloop transitions, 4 changer transitions 4/143 dead transitions. [2024-12-02 15:49:18,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 429 flow [2024-12-02 15:49:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-12-02 15:49:18,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2024-12-02 15:49:18,516 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 408 flow. Second operand 3 states and 395 transitions. [2024-12-02 15:49:18,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 429 flow [2024-12-02 15:49:18,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 417 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:18,519 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 368 flow [2024-12-02 15:49:18,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=147, PETRI_TRANSITIONS=136} [2024-12-02 15:49:18,519 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2024-12-02 15:49:18,519 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 368 flow [2024-12-02 15:49:18,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:18,520 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:18,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 15:49:18,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-12-02 15:49:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 721053446, now seen corresponding path program 1 times [2024-12-02 15:49:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054489380] [2024-12-02 15:49:18,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:18,554 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:49:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:18,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:49:18,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-12-02 15:49:18,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-12-02 15:49:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 15:49:18,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:18,591 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 15:49:18,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-02 15:49:18,608 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-02 15:49:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 157 transitions, 341 flow [2024-12-02 15:49:18,650 INFO L124 PetriNetUnfolderBase]: 21/527 cut-off events. [2024-12-02 15:49:18,650 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-12-02 15:49:18,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 527 events. 21/527 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1315 event pairs, 1 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 316. Up to 16 conditions per place. [2024-12-02 15:49:18,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 157 transitions, 341 flow [2024-12-02 15:49:18,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 157 transitions, 341 flow [2024-12-02 15:49:18,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:49:18,654 INFO L333 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, 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;@4362ec57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:49:18,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-12-02 15:49:18,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:49:18,657 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-12-02 15:49:18,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:49:18,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:18,657 INFO L206 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] [2024-12-02 15:49:18,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -277547135, now seen corresponding path program 1 times [2024-12-02 15:49:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:18,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371900071] [2024-12-02 15:49:18,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371900071] [2024-12-02 15:49:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371900071] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258085024] [2024-12-02 15:49:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:18,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:18,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:18,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:18,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 157 [2024-12-02 15:49:18,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 157 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:18,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:18,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 157 [2024-12-02 15:49:18,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:19,120 INFO L124 PetriNetUnfolderBase]: 1071/4747 cut-off events. [2024-12-02 15:49:19,120 INFO L125 PetriNetUnfolderBase]: For 467/854 co-relation queries the response was YES. [2024-12-02 15:49:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 4747 events. 1071/4747 cut-off events. For 467/854 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 42241 event pairs, 542 based on Foata normal form. 171/4389 useless extension candidates. Maximal degree in co-relation 5220. Up to 1110 conditions per place. [2024-12-02 15:49:19,144 INFO L140 encePairwiseOnDemand]: 148/157 looper letters, 23 selfloop transitions, 5 changer transitions 1/164 dead transitions. [2024-12-02 15:49:19,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 411 flow [2024-12-02 15:49:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2024-12-02 15:49:19,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9341825902335457 [2024-12-02 15:49:19,146 INFO L175 Difference]: Start difference. First operand has 158 places, 157 transitions, 341 flow. Second operand 3 states and 440 transitions. [2024-12-02 15:49:19,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 411 flow [2024-12-02 15:49:19,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 15:49:19,148 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 371 flow [2024-12-02 15:49:19,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2024-12-02 15:49:19,148 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 4 predicate places. [2024-12-02 15:49:19,148 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 371 flow [2024-12-02 15:49:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:19,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:19,149 INFO L206 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] [2024-12-02 15:49:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 15:49:19,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:19,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:19,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1362073320, now seen corresponding path program 1 times [2024-12-02 15:49:19,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:19,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902477289] [2024-12-02 15:49:19,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902477289] [2024-12-02 15:49:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902477289] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90776324] [2024-12-02 15:49:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:19,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:19,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:19,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:19,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2024-12-02 15:49:19,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:19,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:19,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2024-12-02 15:49:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:19,891 INFO L124 PetriNetUnfolderBase]: 1404/6861 cut-off events. [2024-12-02 15:49:19,892 INFO L125 PetriNetUnfolderBase]: For 443/458 co-relation queries the response was YES. [2024-12-02 15:49:19,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 6861 events. 1404/6861 cut-off events. For 443/458 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 66443 event pairs, 1086 based on Foata normal form. 1/6146 useless extension candidates. Maximal degree in co-relation 6125. Up to 1847 conditions per place. [2024-12-02 15:49:19,922 INFO L140 encePairwiseOnDemand]: 149/157 looper letters, 24 selfloop transitions, 2 changer transitions 5/165 dead transitions. [2024-12-02 15:49:19,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 165 transitions, 449 flow [2024-12-02 15:49:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2024-12-02 15:49:19,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683651804670913 [2024-12-02 15:49:19,925 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 371 flow. Second operand 6 states and 818 transitions. [2024-12-02 15:49:19,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 165 transitions, 449 flow [2024-12-02 15:49:19,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:19,933 INFO L231 Difference]: Finished difference. Result has 168 places, 158 transitions, 383 flow [2024-12-02 15:49:19,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=168, PETRI_TRANSITIONS=158} [2024-12-02 15:49:19,933 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 10 predicate places. [2024-12-02 15:49:19,933 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 383 flow [2024-12-02 15:49:19,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:19,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:19,934 INFO L206 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] [2024-12-02 15:49:19,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 15:49:19,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2126993151, now seen corresponding path program 1 times [2024-12-02 15:49:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682326255] [2024-12-02 15:49:19,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:20,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:20,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682326255] [2024-12-02 15:49:20,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682326255] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:20,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:20,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:20,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383974882] [2024-12-02 15:49:20,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:20,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:20,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:20,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:20,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 157 [2024-12-02 15:49:20,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:20,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:20,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 157 [2024-12-02 15:49:20,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:21,667 INFO L124 PetriNetUnfolderBase]: 3152/13178 cut-off events. [2024-12-02 15:49:21,667 INFO L125 PetriNetUnfolderBase]: For 507/508 co-relation queries the response was YES. [2024-12-02 15:49:21,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 13178 events. 3152/13178 cut-off events. For 507/508 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 142826 event pairs, 2465 based on Foata normal form. 0/11518 useless extension candidates. Maximal degree in co-relation 19209. Up to 3699 conditions per place. [2024-12-02 15:49:21,721 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 61 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-12-02 15:49:21,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 561 flow [2024-12-02 15:49:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2024-12-02 15:49:21,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7834394904458599 [2024-12-02 15:49:21,724 INFO L175 Difference]: Start difference. First operand has 168 places, 158 transitions, 383 flow. Second operand 6 states and 738 transitions. [2024-12-02 15:49:21,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 561 flow [2024-12-02 15:49:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 181 transitions, 549 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 15:49:21,731 INFO L231 Difference]: Finished difference. Result has 165 places, 157 transitions, 379 flow [2024-12-02 15:49:21,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=165, PETRI_TRANSITIONS=157} [2024-12-02 15:49:21,731 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 7 predicate places. [2024-12-02 15:49:21,732 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 157 transitions, 379 flow [2024-12-02 15:49:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:21,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:21,732 INFO L206 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] [2024-12-02 15:49:21,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 15:49:21,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:21,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash -351086992, now seen corresponding path program 1 times [2024-12-02 15:49:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:21,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793534174] [2024-12-02 15:49:21,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793534174] [2024-12-02 15:49:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793534174] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830864893] [2024-12-02 15:49:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:21,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:21,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:21,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:22,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 157 [2024-12-02 15:49:22,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 157 transitions, 379 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:22,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:22,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 157 [2024-12-02 15:49:22,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:23,499 INFO L124 PetriNetUnfolderBase]: 3180/13177 cut-off events. [2024-12-02 15:49:23,499 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-12-02 15:49:23,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19214 conditions, 13177 events. 3180/13177 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 142837 event pairs, 1609 based on Foata normal form. 0/11456 useless extension candidates. Maximal degree in co-relation 12505. Up to 3627 conditions per place. [2024-12-02 15:49:23,550 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 58 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2024-12-02 15:49:23,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 551 flow [2024-12-02 15:49:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2024-12-02 15:49:23,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7940552016985138 [2024-12-02 15:49:23,551 INFO L175 Difference]: Start difference. First operand has 165 places, 157 transitions, 379 flow. Second operand 6 states and 748 transitions. [2024-12-02 15:49:23,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 551 flow [2024-12-02 15:49:23,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:23,555 INFO L231 Difference]: Finished difference. Result has 164 places, 156 transitions, 377 flow [2024-12-02 15:49:23,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=164, PETRI_TRANSITIONS=156} [2024-12-02 15:49:23,555 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2024-12-02 15:49:23,555 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 156 transitions, 377 flow [2024-12-02 15:49:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:23,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:23,556 INFO L206 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] [2024-12-02 15:49:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-02 15:49:23,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:23,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1421320132, now seen corresponding path program 1 times [2024-12-02 15:49:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:23,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612714087] [2024-12-02 15:49:23,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:23,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:23,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612714087] [2024-12-02 15:49:23,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612714087] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:23,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:23,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:23,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126720527] [2024-12-02 15:49:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:23,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:23,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:23,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:23,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:23,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2024-12-02 15:49:23,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 156 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:23,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:23,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2024-12-02 15:49:23,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:24,542 INFO L124 PetriNetUnfolderBase]: 1743/7668 cut-off events. [2024-12-02 15:49:24,542 INFO L125 PetriNetUnfolderBase]: For 1814/3268 co-relation queries the response was YES. [2024-12-02 15:49:24,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11998 conditions, 7668 events. 1743/7668 cut-off events. For 1814/3268 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 78703 event pairs, 967 based on Foata normal form. 9/6727 useless extension candidates. Maximal degree in co-relation 10027. Up to 2242 conditions per place. [2024-12-02 15:49:24,565 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 29 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2024-12-02 15:49:24,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 511 flow [2024-12-02 15:49:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2024-12-02 15:49:24,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9256900212314225 [2024-12-02 15:49:24,566 INFO L175 Difference]: Start difference. First operand has 164 places, 156 transitions, 377 flow. Second operand 3 states and 436 transitions. [2024-12-02 15:49:24,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 511 flow [2024-12-02 15:49:24,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 171 transitions, 501 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:24,570 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 443 flow [2024-12-02 15:49:24,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2024-12-02 15:49:24,570 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 5 predicate places. [2024-12-02 15:49:24,571 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 443 flow [2024-12-02 15:49:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:24,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:24,571 INFO L206 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] [2024-12-02 15:49:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-02 15:49:24,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 924546644, now seen corresponding path program 1 times [2024-12-02 15:49:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728083420] [2024-12-02 15:49:24,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728083420] [2024-12-02 15:49:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728083420] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:24,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:24,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270730039] [2024-12-02 15:49:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:25,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 157 [2024-12-02 15:49:25,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:25,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:25,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 157 [2024-12-02 15:49:25,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:26,462 INFO L124 PetriNetUnfolderBase]: 3779/14522 cut-off events. [2024-12-02 15:49:26,462 INFO L125 PetriNetUnfolderBase]: For 2116/2667 co-relation queries the response was YES. [2024-12-02 15:49:26,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23789 conditions, 14522 events. 3779/14522 cut-off events. For 2116/2667 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 163548 event pairs, 1889 based on Foata normal form. 17/12972 useless extension candidates. Maximal degree in co-relation 18569. Up to 2793 conditions per place. [2024-12-02 15:49:26,530 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 55 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2024-12-02 15:49:26,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 185 transitions, 607 flow [2024-12-02 15:49:26,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2024-12-02 15:49:26,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046709129511678 [2024-12-02 15:49:26,532 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 443 flow. Second operand 6 states and 758 transitions. [2024-12-02 15:49:26,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 185 transitions, 607 flow [2024-12-02 15:49:26,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 185 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:26,546 INFO L231 Difference]: Finished difference. Result has 164 places, 161 transitions, 431 flow [2024-12-02 15:49:26,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=164, PETRI_TRANSITIONS=161} [2024-12-02 15:49:26,547 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 6 predicate places. [2024-12-02 15:49:26,547 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 161 transitions, 431 flow [2024-12-02 15:49:26,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:26,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:26,547 INFO L206 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] [2024-12-02 15:49:26,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-02 15:49:26,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1569767876, now seen corresponding path program 1 times [2024-12-02 15:49:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063374725] [2024-12-02 15:49:26,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:49:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063374725] [2024-12-02 15:49:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063374725] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:49:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654223241] [2024-12-02 15:49:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:26,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:26,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:26,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:26,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 157 [2024-12-02 15:49:26,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 161 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:26,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:26,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 157 [2024-12-02 15:49:26,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:27,763 INFO L124 PetriNetUnfolderBase]: 1302/7697 cut-off events. [2024-12-02 15:49:27,763 INFO L125 PetriNetUnfolderBase]: For 964/1221 co-relation queries the response was YES. [2024-12-02 15:49:27,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11596 conditions, 7697 events. 1302/7697 cut-off events. For 964/1221 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 79553 event pairs, 530 based on Foata normal form. 65/7066 useless extension candidates. Maximal degree in co-relation 5585. Up to 1223 conditions per place. [2024-12-02 15:49:27,798 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 38 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2024-12-02 15:49:27,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 568 flow [2024-12-02 15:49:27,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2024-12-02 15:49:27,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8757961783439491 [2024-12-02 15:49:27,799 INFO L175 Difference]: Start difference. First operand has 164 places, 161 transitions, 431 flow. Second operand 6 states and 825 transitions. [2024-12-02 15:49:27,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 568 flow [2024-12-02 15:49:27,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 180 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:27,804 INFO L231 Difference]: Finished difference. Result has 166 places, 163 transitions, 447 flow [2024-12-02 15:49:27,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=166, PETRI_TRANSITIONS=163} [2024-12-02 15:49:27,805 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2024-12-02 15:49:27,805 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 163 transitions, 447 flow [2024-12-02 15:49:27,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:27,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:27,806 INFO L206 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] [2024-12-02 15:49:27,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 15:49:27,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:27,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:27,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1191197380, now seen corresponding path program 1 times [2024-12-02 15:49:27,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507590315] [2024-12-02 15:49:27,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:49:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507590315] [2024-12-02 15:49:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507590315] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:28,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:28,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969770698] [2024-12-02 15:49:28,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:28,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:28,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:28,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 157 [2024-12-02 15:49:28,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 447 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:28,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:28,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 157 [2024-12-02 15:49:28,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:29,354 INFO L124 PetriNetUnfolderBase]: 2701/10581 cut-off events. [2024-12-02 15:49:29,354 INFO L125 PetriNetUnfolderBase]: For 982/1400 co-relation queries the response was YES. [2024-12-02 15:49:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17027 conditions, 10581 events. 2701/10581 cut-off events. For 982/1400 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 112877 event pairs, 1410 based on Foata normal form. 11/9539 useless extension candidates. Maximal degree in co-relation 12583. Up to 2113 conditions per place. [2024-12-02 15:49:29,399 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 48 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2024-12-02 15:49:29,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 599 flow [2024-12-02 15:49:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2024-12-02 15:49:29,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8471337579617835 [2024-12-02 15:49:29,400 INFO L175 Difference]: Start difference. First operand has 166 places, 163 transitions, 447 flow. Second operand 6 states and 798 transitions. [2024-12-02 15:49:29,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 186 transitions, 599 flow [2024-12-02 15:49:29,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 186 transitions, 591 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 15:49:29,403 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 447 flow [2024-12-02 15:49:29,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2024-12-02 15:49:29,404 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2024-12-02 15:49:29,404 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 447 flow [2024-12-02 15:49:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:29,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:29,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 15:49:29,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -453159705, now seen corresponding path program 1 times [2024-12-02 15:49:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822073986] [2024-12-02 15:49:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:49:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822073986] [2024-12-02 15:49:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822073986] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814135095] [2024-12-02 15:49:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:29,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2024-12-02 15:49:29,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:29,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:29,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2024-12-02 15:49:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:30,090 INFO L124 PetriNetUnfolderBase]: 1086/6184 cut-off events. [2024-12-02 15:49:30,090 INFO L125 PetriNetUnfolderBase]: For 2861/4532 co-relation queries the response was YES. [2024-12-02 15:49:30,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 6184 events. 1086/6184 cut-off events. For 2861/4532 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 66088 event pairs, 589 based on Foata normal form. 13/5734 useless extension candidates. Maximal degree in co-relation 9427. Up to 1450 conditions per place. [2024-12-02 15:49:30,119 INFO L140 encePairwiseOnDemand]: 150/157 looper letters, 31 selfloop transitions, 13 changer transitions 0/178 dead transitions. [2024-12-02 15:49:30,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 178 transitions, 608 flow [2024-12-02 15:49:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-12-02 15:49:30,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235668789808917 [2024-12-02 15:49:30,120 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 447 flow. Second operand 3 states and 435 transitions. [2024-12-02 15:49:30,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 178 transitions, 608 flow [2024-12-02 15:49:30,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 178 transitions, 598 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:30,125 INFO L231 Difference]: Finished difference. Result has 166 places, 171 transitions, 555 flow [2024-12-02 15:49:30,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=166, PETRI_TRANSITIONS=171} [2024-12-02 15:49:30,126 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2024-12-02 15:49:30,126 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 171 transitions, 555 flow [2024-12-02 15:49:30,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:30,126 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 15:49:30,127 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:30,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:30,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1374633477, now seen corresponding path program 1 times [2024-12-02 15:49:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106511846] [2024-12-02 15:49:30,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:30,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 15:49:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:30,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106511846] [2024-12-02 15:49:30,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106511846] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:49:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626965635] [2024-12-02 15:49:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:30,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:30,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:30,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 157 [2024-12-02 15:49:30,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 171 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:30,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 157 [2024-12-02 15:49:30,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:30,411 INFO L124 PetriNetUnfolderBase]: 124/2155 cut-off events. [2024-12-02 15:49:30,411 INFO L125 PetriNetUnfolderBase]: For 721/844 co-relation queries the response was YES. [2024-12-02 15:49:30,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 2155 events. 124/2155 cut-off events. For 721/844 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17160 event pairs, 20 based on Foata normal form. 26/2104 useless extension candidates. Maximal degree in co-relation 1243. Up to 142 conditions per place. [2024-12-02 15:49:30,417 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 12 selfloop transitions, 6 changer transitions 0/166 dead transitions. [2024-12-02 15:49:30,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 528 flow [2024-12-02 15:49:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2024-12-02 15:49:30,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426751592356688 [2024-12-02 15:49:30,418 INFO L175 Difference]: Start difference. First operand has 166 places, 171 transitions, 555 flow. Second operand 3 states and 444 transitions. [2024-12-02 15:49:30,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 528 flow [2024-12-02 15:49:30,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 514 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:30,421 INFO L231 Difference]: Finished difference. Result has 166 places, 161 transitions, 459 flow [2024-12-02 15:49:30,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2024-12-02 15:49:30,421 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 8 predicate places. [2024-12-02 15:49:30,421 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 459 flow [2024-12-02 15:49:30,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:30,422 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:30,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 15:49:30,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:30,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 404386211, now seen corresponding path program 1 times [2024-12-02 15:49:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035402408] [2024-12-02 15:49:30,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 15:49:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035402408] [2024-12-02 15:49:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035402408] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:30,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309697760] [2024-12-02 15:49:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:30,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:30,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:30,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 157 [2024-12-02 15:49:30,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:30,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 157 [2024-12-02 15:49:30,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:30,726 INFO L124 PetriNetUnfolderBase]: 203/2144 cut-off events. [2024-12-02 15:49:30,726 INFO L125 PetriNetUnfolderBase]: For 1459/1954 co-relation queries the response was YES. [2024-12-02 15:49:30,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 2144 events. 203/2144 cut-off events. For 1459/1954 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17768 event pairs, 134 based on Foata normal form. 3/1995 useless extension candidates. Maximal degree in co-relation 3042. Up to 435 conditions per place. [2024-12-02 15:49:30,731 INFO L140 encePairwiseOnDemand]: 152/157 looper letters, 25 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2024-12-02 15:49:30,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 541 flow [2024-12-02 15:49:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2024-12-02 15:49:30,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087048832271762 [2024-12-02 15:49:30,732 INFO L175 Difference]: Start difference. First operand has 166 places, 161 transitions, 459 flow. Second operand 3 states and 428 transitions. [2024-12-02 15:49:30,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 541 flow [2024-12-02 15:49:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 15:49:30,737 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 493 flow [2024-12-02 15:49:30,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2024-12-02 15:49:30,738 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, 11 predicate places. [2024-12-02 15:49:30,738 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 493 flow [2024-12-02 15:49:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:30,739 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-02 15:49:30,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-12-02 15:49:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 140567554, now seen corresponding path program 1 times [2024-12-02 15:49:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456472763] [2024-12-02 15:49:30,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:30,777 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:49:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:49:30,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:49:30,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-12-02 15:49:30,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-12-02 15:49:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-02 15:49:30,820 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:49:30,821 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 15:49:30,821 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-02 15:49:30,838 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-02 15:49:30,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 175 transitions, 390 flow [2024-12-02 15:49:30,923 INFO L124 PetriNetUnfolderBase]: 43/918 cut-off events. [2024-12-02 15:49:30,923 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-12-02 15:49:30,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 918 events. 43/918 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3080 event pairs, 6 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 547. Up to 32 conditions per place. [2024-12-02 15:49:30,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 175 transitions, 390 flow [2024-12-02 15:49:30,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 175 transitions, 390 flow [2024-12-02 15:49:30,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:49:30,928 INFO L333 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, 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;@4362ec57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:49:30,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-12-02 15:49:30,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:49:30,929 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-12-02 15:49:30,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:49:30,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:30,930 INFO L206 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] [2024-12-02 15:49:30,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:49:30,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 481995617, now seen corresponding path program 1 times [2024-12-02 15:49:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:30,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930446078] [2024-12-02 15:49:30,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:30,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930446078] [2024-12-02 15:49:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930446078] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044981088] [2024-12-02 15:49:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:30,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:30,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:30,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 175 [2024-12-02 15:49:30,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 175 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:30,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:30,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 175 [2024-12-02 15:49:30,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:33,775 INFO L124 PetriNetUnfolderBase]: 7859/26538 cut-off events. [2024-12-02 15:49:33,775 INFO L125 PetriNetUnfolderBase]: For 2974/5699 co-relation queries the response was YES. [2024-12-02 15:49:33,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38888 conditions, 26538 events. 7859/26538 cut-off events. For 2974/5699 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 305342 event pairs, 4292 based on Foata normal form. 798/24607 useless extension candidates. Maximal degree in co-relation 30851. Up to 7653 conditions per place. [2024-12-02 15:49:33,903 INFO L140 encePairwiseOnDemand]: 165/175 looper letters, 30 selfloop transitions, 6 changer transitions 1/185 dead transitions. [2024-12-02 15:49:33,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 482 flow [2024-12-02 15:49:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:49:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:49:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2024-12-02 15:49:33,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276190476190476 [2024-12-02 15:49:33,905 INFO L175 Difference]: Start difference. First operand has 177 places, 175 transitions, 390 flow. Second operand 3 states and 487 transitions. [2024-12-02 15:49:33,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 482 flow [2024-12-02 15:49:33,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 15:49:33,909 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 428 flow [2024-12-02 15:49:33,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2024-12-02 15:49:33,909 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 4 predicate places. [2024-12-02 15:49:33,909 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 428 flow [2024-12-02 15:49:33,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:33,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:33,909 INFO L206 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] [2024-12-02 15:49:33,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 15:49:33,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:49:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1138223272, now seen corresponding path program 1 times [2024-12-02 15:49:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896745534] [2024-12-02 15:49:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:33,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896745534] [2024-12-02 15:49:33,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896745534] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:33,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:33,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459841716] [2024-12-02 15:49:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:33,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:49:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:33,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:49:33,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:49:34,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 175 [2024-12-02 15:49:34,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:34,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:34,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 175 [2024-12-02 15:49:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:38,566 INFO L124 PetriNetUnfolderBase]: 9343/35816 cut-off events. [2024-12-02 15:49:38,566 INFO L125 PetriNetUnfolderBase]: For 2632/2756 co-relation queries the response was YES. [2024-12-02 15:49:38,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52733 conditions, 35816 events. 9343/35816 cut-off events. For 2632/2756 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 443804 event pairs, 7523 based on Foata normal form. 1/31567 useless extension candidates. Maximal degree in co-relation 32440. Up to 10778 conditions per place. [2024-12-02 15:49:38,737 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 28 selfloop transitions, 2 changer transitions 5/184 dead transitions. [2024-12-02 15:49:38,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 514 flow [2024-12-02 15:49:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 906 transitions. [2024-12-02 15:49:38,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8628571428571429 [2024-12-02 15:49:38,738 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 428 flow. Second operand 6 states and 906 transitions. [2024-12-02 15:49:38,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 514 flow [2024-12-02 15:49:38,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:49:38,779 INFO L231 Difference]: Finished difference. Result has 187 places, 177 transitions, 438 flow [2024-12-02 15:49:38,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=187, PETRI_TRANSITIONS=177} [2024-12-02 15:49:38,779 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 10 predicate places. [2024-12-02 15:49:38,779 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 177 transitions, 438 flow [2024-12-02 15:49:38,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:38,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:38,780 INFO L206 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] [2024-12-02 15:49:38,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-02 15:49:38,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:49:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -517390866, now seen corresponding path program 1 times [2024-12-02 15:49:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378389711] [2024-12-02 15:49:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378389711] [2024-12-02 15:49:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378389711] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986321651] [2024-12-02 15:49:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:38,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:39,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 175 [2024-12-02 15:49:39,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 177 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:39,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:39,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 175 [2024-12-02 15:49:39,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:47,756 INFO L124 PetriNetUnfolderBase]: 20475/70474 cut-off events. [2024-12-02 15:49:47,756 INFO L125 PetriNetUnfolderBase]: For 2766/2782 co-relation queries the response was YES. [2024-12-02 15:49:48,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105344 conditions, 70474 events. 20475/70474 cut-off events. For 2766/2782 co-relation queries the response was YES. Maximal size of possible extension queue 1690. Compared 937588 event pairs, 16494 based on Foata normal form. 0/60691 useless extension candidates. Maximal degree in co-relation 105230. Up to 21481 conditions per place. [2024-12-02 15:49:48,430 INFO L140 encePairwiseOnDemand]: 169/175 looper letters, 73 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2024-12-02 15:49:48,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 656 flow [2024-12-02 15:49:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 834 transitions. [2024-12-02 15:49:48,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7942857142857143 [2024-12-02 15:49:48,432 INFO L175 Difference]: Start difference. First operand has 187 places, 177 transitions, 438 flow. Second operand 6 states and 834 transitions. [2024-12-02 15:49:48,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 656 flow [2024-12-02 15:49:48,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 644 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 15:49:48,496 INFO L231 Difference]: Finished difference. Result has 184 places, 176 transitions, 434 flow [2024-12-02 15:49:48,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=184, PETRI_TRANSITIONS=176} [2024-12-02 15:49:48,497 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 7 predicate places. [2024-12-02 15:49:48,497 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 434 flow [2024-12-02 15:49:48,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:48,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:48,497 INFO L206 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] [2024-12-02 15:49:48,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-02 15:49:48,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:49:48,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1137648641, now seen corresponding path program 1 times [2024-12-02 15:49:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160478009] [2024-12-02 15:49:48,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:48,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160478009] [2024-12-02 15:49:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160478009] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:49:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979507724] [2024-12-02 15:49:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:48,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:49:48,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:48,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:49:48,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:49:48,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 175 [2024-12-02 15:49:48,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:48,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:48,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 175 [2024-12-02 15:49:48,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:49:55,694 INFO L124 PetriNetUnfolderBase]: 21685/51607 cut-off events. [2024-12-02 15:49:55,694 INFO L125 PetriNetUnfolderBase]: For 2346/2346 co-relation queries the response was YES. [2024-12-02 15:49:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86514 conditions, 51607 events. 21685/51607 cut-off events. For 2346/2346 co-relation queries the response was YES. Maximal size of possible extension queue 1961. Compared 587128 event pairs, 3534 based on Foata normal form. 0/45288 useless extension candidates. Maximal degree in co-relation 15703. Up to 25048 conditions per place. [2024-12-02 15:49:55,982 INFO L140 encePairwiseOnDemand]: 169/175 looper letters, 70 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2024-12-02 15:49:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 207 transitions, 646 flow [2024-12-02 15:49:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:49:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:49:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2024-12-02 15:49:55,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2024-12-02 15:49:55,983 INFO L175 Difference]: Start difference. First operand has 184 places, 176 transitions, 434 flow. Second operand 6 states and 844 transitions. [2024-12-02 15:49:55,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 207 transitions, 646 flow [2024-12-02 15:49:55,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 207 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:49:55,987 INFO L231 Difference]: Finished difference. Result has 183 places, 175 transitions, 432 flow [2024-12-02 15:49:55,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=183, PETRI_TRANSITIONS=175} [2024-12-02 15:49:55,987 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2024-12-02 15:49:55,987 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 432 flow [2024-12-02 15:49:55,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:55,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:49:55,988 INFO L206 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] [2024-12-02 15:49:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-02 15:49:55,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:49:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:49:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1293358547, now seen corresponding path program 1 times [2024-12-02 15:49:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:49:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101830590] [2024-12-02 15:49:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:49:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:49:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:49:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:49:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:49:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101830590] [2024-12-02 15:49:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101830590] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:49:56,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:49:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:49:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555042915] [2024-12-02 15:49:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:49:56,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:49:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:49:56,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:49:56,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:49:56,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2024-12-02 15:49:56,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 175 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:49:56,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:49:56,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2024-12-02 15:49:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:01,532 INFO L124 PetriNetUnfolderBase]: 13641/46120 cut-off events. [2024-12-02 15:50:01,532 INFO L125 PetriNetUnfolderBase]: For 11665/23311 co-relation queries the response was YES. [2024-12-02 15:50:01,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75500 conditions, 46120 events. 13641/46120 cut-off events. For 11665/23311 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 590298 event pairs, 7860 based on Foata normal form. 33/40368 useless extension candidates. Maximal degree in co-relation 62457. Up to 15890 conditions per place. [2024-12-02 15:50:01,786 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 39 selfloop transitions, 11 changer transitions 0/196 dead transitions. [2024-12-02 15:50:01,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 618 flow [2024-12-02 15:50:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2024-12-02 15:50:01,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2024-12-02 15:50:01,787 INFO L175 Difference]: Start difference. First operand has 183 places, 175 transitions, 432 flow. Second operand 3 states and 485 transitions. [2024-12-02 15:50:01,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 618 flow [2024-12-02 15:50:01,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 196 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:50:01,794 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 518 flow [2024-12-02 15:50:01,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=182, PETRI_TRANSITIONS=184} [2024-12-02 15:50:01,795 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2024-12-02 15:50:01,795 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 518 flow [2024-12-02 15:50:01,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:01,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:01,795 INFO L206 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] [2024-12-02 15:50:01,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-02 15:50:01,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:01,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 374267123, now seen corresponding path program 1 times [2024-12-02 15:50:01,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:01,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147437901] [2024-12-02 15:50:01,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147437901] [2024-12-02 15:50:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147437901] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:50:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776404241] [2024-12-02 15:50:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:50:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:01,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:50:01,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:50:02,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 175 [2024-12-02 15:50:02,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 184 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:02,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:02,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 175 [2024-12-02 15:50:02,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:09,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 213#true, 95#L1027true, 174#true, 177#true, 208#true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 48#L1025-3true, 176#true]) [2024-12-02 15:50:09,875 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2024-12-02 15:50:09,875 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2024-12-02 15:50:09,875 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-12-02 15:50:09,875 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-12-02 15:50:10,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][211], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L1026-6true, 172#true, 213#true, 173#true, 69#L1026-5true, 208#true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 178#true]) [2024-12-02 15:50:10,023 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,023 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,023 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,023 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 33#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 213#true, 91#L1026-5true, 174#true, 177#true, 208#true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true]) [2024-12-02 15:50:10,096 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,096 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-12-02 15:50:10,096 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:10,097 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-12-02 15:50:10,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][206], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 213#true, 173#true, 95#L1027true, 69#L1026-5true, 208#true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 178#true]) [2024-12-02 15:50:10,826 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is not cut-off event [2024-12-02 15:50:10,826 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:10,826 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:10,826 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:11,615 INFO L124 PetriNetUnfolderBase]: 26591/80056 cut-off events. [2024-12-02 15:50:11,615 INFO L125 PetriNetUnfolderBase]: For 11671/15543 co-relation queries the response was YES. [2024-12-02 15:50:11,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135630 conditions, 80056 events. 26591/80056 cut-off events. For 11671/15543 co-relation queries the response was YES. Maximal size of possible extension queue 2206. Compared 1065830 event pairs, 12572 based on Foata normal form. 80/70463 useless extension candidates. Maximal degree in co-relation 104955. Up to 15809 conditions per place. [2024-12-02 15:50:12,056 INFO L140 encePairwiseOnDemand]: 168/175 looper letters, 67 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2024-12-02 15:50:12,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 214 transitions, 722 flow [2024-12-02 15:50:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:50:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:50:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 854 transitions. [2024-12-02 15:50:12,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8133333333333334 [2024-12-02 15:50:12,058 INFO L175 Difference]: Start difference. First operand has 182 places, 184 transitions, 518 flow. Second operand 6 states and 854 transitions. [2024-12-02 15:50:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 214 transitions, 722 flow [2024-12-02 15:50:12,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 214 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:50:12,169 INFO L231 Difference]: Finished difference. Result has 183 places, 182 transitions, 502 flow [2024-12-02 15:50:12,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2024-12-02 15:50:12,169 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2024-12-02 15:50:12,169 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 502 flow [2024-12-02 15:50:12,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:12,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:12,170 INFO L206 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] [2024-12-02 15:50:12,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-02 15:50:12,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -706947405, now seen corresponding path program 1 times [2024-12-02 15:50:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327752605] [2024-12-02 15:50:12,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327752605] [2024-12-02 15:50:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327752605] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:50:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400103177] [2024-12-02 15:50:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:50:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:50:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:50:12,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2024-12-02 15:50:12,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:12,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:12,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2024-12-02 15:50:12,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:16,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][203], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L1026-6true, 172#true, 213#true, 173#true, 69#L1026-5true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 178#true]) [2024-12-02 15:50:16,486 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-12-02 15:50:16,486 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:16,486 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:16,486 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:17,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][202], [Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 213#true, 173#true, 95#L1027true, 69#L1026-5true, 106#L1026-5true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 178#true]) [2024-12-02 15:50:17,041 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is not cut-off event [2024-12-02 15:50:17,041 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:17,041 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:17,041 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is not cut-off event [2024-12-02 15:50:17,674 INFO L124 PetriNetUnfolderBase]: 10041/43474 cut-off events. [2024-12-02 15:50:17,674 INFO L125 PetriNetUnfolderBase]: For 6115/8270 co-relation queries the response was YES. [2024-12-02 15:50:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68293 conditions, 43474 events. 10041/43474 cut-off events. For 6115/8270 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 579095 event pairs, 4493 based on Foata normal form. 283/39092 useless extension candidates. Maximal degree in co-relation 34712. Up to 7595 conditions per place. [2024-12-02 15:50:18,037 INFO L140 encePairwiseOnDemand]: 168/175 looper letters, 47 selfloop transitions, 6 changer transitions 0/206 dead transitions. [2024-12-02 15:50:18,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 206 transitions, 670 flow [2024-12-02 15:50:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:50:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:50:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2024-12-02 15:50:18,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8742857142857143 [2024-12-02 15:50:18,039 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 502 flow. Second operand 6 states and 918 transitions. [2024-12-02 15:50:18,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 206 transitions, 670 flow [2024-12-02 15:50:18,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 206 transitions, 658 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:50:18,052 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 518 flow [2024-12-02 15:50:18,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2024-12-02 15:50:18,053 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 8 predicate places. [2024-12-02 15:50:18,053 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 518 flow [2024-12-02 15:50:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:18,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:18,053 INFO L206 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] [2024-12-02 15:50:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-02 15:50:18,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2132953027, now seen corresponding path program 1 times [2024-12-02 15:50:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107169937] [2024-12-02 15:50:18,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107169937] [2024-12-02 15:50:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107169937] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:18,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:50:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066610991] [2024-12-02 15:50:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:18,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:50:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:18,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:50:18,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:50:18,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 175 [2024-12-02 15:50:18,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:18,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:18,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 175 [2024-12-02 15:50:18,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:23,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][214], [Black: 224#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 221#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L1026-6true, 172#true, 173#true, 69#L1026-5true, 106#L1026-5true, 227#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 178#true]) [2024-12-02 15:50:23,602 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2024-12-02 15:50:23,602 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:23,602 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:23,602 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-12-02 15:50:23,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([798] L1026-4-->L1026-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][213], [Black: 224#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 221#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 173#true, 95#L1027true, 69#L1026-5true, 106#L1026-5true, 227#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 178#true]) [2024-12-02 15:50:23,831 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-12-02 15:50:23,831 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-12-02 15:50:23,831 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-12-02 15:50:23,831 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-12-02 15:50:25,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][211], [Black: 224#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 221#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 18#L1026-6true, 172#true, 173#true, 177#true, 106#L1026-5true, 227#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|)]) [2024-12-02 15:50:25,033 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-12-02 15:50:25,033 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-12-02 15:50:25,033 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-12-02 15:50:25,033 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-12-02 15:50:25,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L1026-4-->L1026-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][207], [Black: 224#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 221#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 173#true, 95#L1027true, 177#true, 106#L1026-5true, 227#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 182#(= |#race~data~0| 0), 28#L1044-1true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|)]) [2024-12-02 15:50:25,076 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-12-02 15:50:25,076 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-12-02 15:50:25,076 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-12-02 15:50:25,076 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-12-02 15:50:25,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([698] L1043-1-->L1044: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][142], [Black: 224#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 221#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 187#(= |ULTIMATE.start_main_~i~0#1| 0), 172#true, 97#L1044true, 173#true, 95#L1027true, 177#true, 106#L1026-5true, 227#true, Black: 210#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 180#true, 176#true, 223#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|)]) [2024-12-02 15:50:25,137 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-12-02 15:50:25,137 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 15:50:25,137 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-12-02 15:50:25,137 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-12-02 15:50:25,255 INFO L124 PetriNetUnfolderBase]: 19132/58409 cut-off events. [2024-12-02 15:50:25,256 INFO L125 PetriNetUnfolderBase]: For 6243/9365 co-relation queries the response was YES. [2024-12-02 15:50:25,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97999 conditions, 58409 events. 19132/58409 cut-off events. For 6243/9365 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 752961 event pairs, 9564 based on Foata normal form. 66/51669 useless extension candidates. Maximal degree in co-relation 71634. Up to 12188 conditions per place. [2024-12-02 15:50:25,565 INFO L140 encePairwiseOnDemand]: 169/175 looper letters, 60 selfloop transitions, 5 changer transitions 0/215 dead transitions. [2024-12-02 15:50:25,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 215 transitions, 710 flow [2024-12-02 15:50:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:50:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:50:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 894 transitions. [2024-12-02 15:50:25,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8514285714285714 [2024-12-02 15:50:25,566 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 518 flow. Second operand 6 states and 894 transitions. [2024-12-02 15:50:25,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 215 transitions, 710 flow [2024-12-02 15:50:25,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 215 transitions, 702 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 15:50:25,575 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 518 flow [2024-12-02 15:50:25,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2024-12-02 15:50:25,575 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 9 predicate places. [2024-12-02 15:50:25,575 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 518 flow [2024-12-02 15:50:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:25,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:25,576 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:25,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-02 15:50:25,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:25,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1062488169, now seen corresponding path program 1 times [2024-12-02 15:50:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968906144] [2024-12-02 15:50:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:25,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:25,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968906144] [2024-12-02 15:50:25,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968906144] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:25,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:25,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:50:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109967390] [2024-12-02 15:50:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:25,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:50:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:25,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:50:25,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:50:25,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2024-12-02 15:50:25,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:25,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:25,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2024-12-02 15:50:25,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:32,022 INFO L124 PetriNetUnfolderBase]: 11757/49577 cut-off events. [2024-12-02 15:50:32,022 INFO L125 PetriNetUnfolderBase]: For 25152/40856 co-relation queries the response was YES. [2024-12-02 15:50:32,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86913 conditions, 49577 events. 11757/49577 cut-off events. For 25152/40856 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 698404 event pairs, 6042 based on Foata normal form. 48/44546 useless extension candidates. Maximal degree in co-relation 35467. Up to 13486 conditions per place. [2024-12-02 15:50:32,285 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 43 selfloop transitions, 18 changer transitions 0/208 dead transitions. [2024-12-02 15:50:32,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 763 flow [2024-12-02 15:50:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2024-12-02 15:50:32,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219047619047619 [2024-12-02 15:50:32,286 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 518 flow. Second operand 3 states and 484 transitions. [2024-12-02 15:50:32,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 208 transitions, 763 flow [2024-12-02 15:50:32,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 208 transitions, 753 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 15:50:32,299 INFO L231 Difference]: Finished difference. Result has 185 places, 197 transitions, 686 flow [2024-12-02 15:50:32,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=185, PETRI_TRANSITIONS=197} [2024-12-02 15:50:32,299 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 8 predicate places. [2024-12-02 15:50:32,299 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 197 transitions, 686 flow [2024-12-02 15:50:32,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:32,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:32,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:32,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-02 15:50:32,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:32,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2084244469, now seen corresponding path program 1 times [2024-12-02 15:50:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:32,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924691667] [2024-12-02 15:50:32,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924691667] [2024-12-02 15:50:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924691667] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:32,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:32,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:50:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479723822] [2024-12-02 15:50:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:32,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:50:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:32,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:50:32,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:50:32,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 175 [2024-12-02 15:50:32,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 197 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:32,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:32,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 175 [2024-12-02 15:50:32,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:33,620 INFO L124 PetriNetUnfolderBase]: 688/8150 cut-off events. [2024-12-02 15:50:33,621 INFO L125 PetriNetUnfolderBase]: For 3214/3676 co-relation queries the response was YES. [2024-12-02 15:50:33,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12533 conditions, 8150 events. 688/8150 cut-off events. For 3214/3676 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 91262 event pairs, 149 based on Foata normal form. 197/7946 useless extension candidates. Maximal degree in co-relation 4901. Up to 662 conditions per place. [2024-12-02 15:50:33,650 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 16 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2024-12-02 15:50:33,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 187 transitions, 619 flow [2024-12-02 15:50:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2024-12-02 15:50:33,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939047619047619 [2024-12-02 15:50:33,652 INFO L175 Difference]: Start difference. First operand has 185 places, 197 transitions, 686 flow. Second operand 3 states and 493 transitions. [2024-12-02 15:50:33,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 187 transitions, 619 flow [2024-12-02 15:50:33,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 605 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-12-02 15:50:33,659 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 526 flow [2024-12-02 15:50:33,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2024-12-02 15:50:33,660 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 8 predicate places. [2024-12-02 15:50:33,660 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 526 flow [2024-12-02 15:50:33,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:33,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:33,661 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:33,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-12-02 15:50:33,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:33,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1893606558, now seen corresponding path program 1 times [2024-12-02 15:50:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:33,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739592765] [2024-12-02 15:50:33,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739592765] [2024-12-02 15:50:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739592765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:33,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:33,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:50:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280050912] [2024-12-02 15:50:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:50:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:33,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:50:33,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:50:33,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2024-12-02 15:50:33,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:33,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:33,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2024-12-02 15:50:33,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:35,053 INFO L124 PetriNetUnfolderBase]: 1114/8489 cut-off events. [2024-12-02 15:50:35,053 INFO L125 PetriNetUnfolderBase]: For 6992/9334 co-relation queries the response was YES. [2024-12-02 15:50:35,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15651 conditions, 8489 events. 1114/8489 cut-off events. For 6992/9334 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 97383 event pairs, 714 based on Foata normal form. 19/7716 useless extension candidates. Maximal degree in co-relation 12218. Up to 2065 conditions per place. [2024-12-02 15:50:35,073 INFO L140 encePairwiseOnDemand]: 170/175 looper letters, 33 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2024-12-02 15:50:35,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 187 transitions, 640 flow [2024-12-02 15:50:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-12-02 15:50:35,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9028571428571428 [2024-12-02 15:50:35,074 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 526 flow. Second operand 3 states and 474 transitions. [2024-12-02 15:50:35,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 187 transitions, 640 flow [2024-12-02 15:50:35,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 187 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 15:50:35,076 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 558 flow [2024-12-02 15:50:35,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2024-12-02 15:50:35,077 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 11 predicate places. [2024-12-02 15:50:35,077 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 558 flow [2024-12-02 15:50:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:35,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:35,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:35,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-12-02 15:50:35,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash -879915908, now seen corresponding path program 1 times [2024-12-02 15:50:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703716630] [2024-12-02 15:50:35,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 15:50:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703716630] [2024-12-02 15:50:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703716630] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:35,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 15:50:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168204955] [2024-12-02 15:50:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 15:50:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:35,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 15:50:35,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 15:50:35,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 175 [2024-12-02 15:50:35,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:35,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:35,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 175 [2024-12-02 15:50:35,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:37,071 INFO L124 PetriNetUnfolderBase]: 2175/12887 cut-off events. [2024-12-02 15:50:37,071 INFO L125 PetriNetUnfolderBase]: For 3987/4147 co-relation queries the response was YES. [2024-12-02 15:50:37,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20985 conditions, 12887 events. 2175/12887 cut-off events. For 3987/4147 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 137458 event pairs, 434 based on Foata normal form. 110/12717 useless extension candidates. Maximal degree in co-relation 8616. Up to 1508 conditions per place. [2024-12-02 15:50:37,109 INFO L140 encePairwiseOnDemand]: 161/175 looper letters, 89 selfloop transitions, 15 changer transitions 14/265 dead transitions. [2024-12-02 15:50:37,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 265 transitions, 1043 flow [2024-12-02 15:50:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 15:50:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 15:50:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1926 transitions. [2024-12-02 15:50:37,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8465934065934065 [2024-12-02 15:50:37,111 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 558 flow. Second operand 13 states and 1926 transitions. [2024-12-02 15:50:37,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 265 transitions, 1043 flow [2024-12-02 15:50:37,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 265 transitions, 1029 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-12-02 15:50:37,116 INFO L231 Difference]: Finished difference. Result has 207 places, 190 transitions, 636 flow [2024-12-02 15:50:37,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=636, PETRI_PLACES=207, PETRI_TRANSITIONS=190} [2024-12-02 15:50:37,116 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 30 predicate places. [2024-12-02 15:50:37,116 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 190 transitions, 636 flow [2024-12-02 15:50:37,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:37,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:37,117 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-12-02 15:50:37,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1441238182, now seen corresponding path program 1 times [2024-12-02 15:50:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800997066] [2024-12-02 15:50:37,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800997066] [2024-12-02 15:50:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800997066] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:50:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371849472] [2024-12-02 15:50:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:50:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:50:37,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:50:37,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2024-12-02 15:50:37,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 190 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:37,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:37,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2024-12-02 15:50:37,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:37,901 INFO L124 PetriNetUnfolderBase]: 720/5553 cut-off events. [2024-12-02 15:50:37,901 INFO L125 PetriNetUnfolderBase]: For 5294/6447 co-relation queries the response was YES. [2024-12-02 15:50:37,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10581 conditions, 5553 events. 720/5553 cut-off events. For 5294/6447 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 56566 event pairs, 539 based on Foata normal form. 4/5111 useless extension candidates. Maximal degree in co-relation 8600. Up to 1312 conditions per place. [2024-12-02 15:50:37,924 INFO L140 encePairwiseOnDemand]: 170/175 looper letters, 33 selfloop transitions, 5 changer transitions 0/196 dead transitions. [2024-12-02 15:50:37,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 196 transitions, 741 flow [2024-12-02 15:50:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-12-02 15:50:37,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900952380952381 [2024-12-02 15:50:37,925 INFO L175 Difference]: Start difference. First operand has 207 places, 190 transitions, 636 flow. Second operand 3 states and 473 transitions. [2024-12-02 15:50:37,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 196 transitions, 741 flow [2024-12-02 15:50:37,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 196 transitions, 725 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 15:50:37,932 INFO L231 Difference]: Finished difference. Result has 206 places, 193 transitions, 662 flow [2024-12-02 15:50:37,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=206, PETRI_TRANSITIONS=193} [2024-12-02 15:50:37,932 INFO L279 CegarLoopForPetriNet]: 177 programPoint places, 29 predicate places. [2024-12-02 15:50:37,932 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 193 transitions, 662 flow [2024-12-02 15:50:37,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:37,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:37,932 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:37,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-12-02 15:50:37,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-02 15:50:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1750315557, now seen corresponding path program 1 times [2024-12-02 15:50:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253571142] [2024-12-02 15:50:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:50:37,975 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:50:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:50:38,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:50:38,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-12-02 15:50:38,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-12-02 15:50:38,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-12-02 15:50:38,027 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:50:38,027 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-02 15:50:38,027 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-02 15:50:38,047 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-02 15:50:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 193 transitions, 441 flow [2024-12-02 15:50:38,224 INFO L124 PetriNetUnfolderBase]: 93/1657 cut-off events. [2024-12-02 15:50:38,224 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-12-02 15:50:38,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 1657 events. 93/1657 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7571 event pairs, 23 based on Foata normal form. 0/1436 useless extension candidates. Maximal degree in co-relation 963. Up to 80 conditions per place. [2024-12-02 15:50:38,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 193 transitions, 441 flow [2024-12-02 15:50:38,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 193 transitions, 441 flow [2024-12-02 15:50:38,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:50:38,234 INFO L333 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, 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;@4362ec57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:50:38,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-12-02 15:50:38,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:50:38,237 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-12-02 15:50:38,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:50:38,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:38,237 INFO L206 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] [2024-12-02 15:50:38,237 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 15:50:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -300153471, now seen corresponding path program 1 times [2024-12-02 15:50:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35515892] [2024-12-02 15:50:38,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35515892] [2024-12-02 15:50:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35515892] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 15:50:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568576271] [2024-12-02 15:50:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:50:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:50:38,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:50:38,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2024-12-02 15:50:38,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 193 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:38,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:38,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2024-12-02 15:50:38,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:50:58,437 INFO L124 PetriNetUnfolderBase]: 51883/146763 cut-off events. [2024-12-02 15:50:58,438 INFO L125 PetriNetUnfolderBase]: For 14725/31815 co-relation queries the response was YES. [2024-12-02 15:50:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222068 conditions, 146763 events. 51883/146763 cut-off events. For 14725/31815 co-relation queries the response was YES. Maximal size of possible extension queue 3350. Compared 2001349 event pairs, 29580 based on Foata normal form. 3694/136368 useless extension candidates. Maximal degree in co-relation 176690. Up to 48608 conditions per place. [2024-12-02 15:50:59,526 INFO L140 encePairwiseOnDemand]: 182/193 looper letters, 37 selfloop transitions, 7 changer transitions 1/206 dead transitions. [2024-12-02 15:50:59,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 206 transitions, 555 flow [2024-12-02 15:50:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:50:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:50:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2024-12-02 15:50:59,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222797927461139 [2024-12-02 15:50:59,528 INFO L175 Difference]: Start difference. First operand has 196 places, 193 transitions, 441 flow. Second operand 3 states and 534 transitions. [2024-12-02 15:50:59,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 206 transitions, 555 flow [2024-12-02 15:50:59,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 206 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 15:50:59,548 INFO L231 Difference]: Finished difference. Result has 200 places, 195 transitions, 487 flow [2024-12-02 15:50:59,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=200, PETRI_TRANSITIONS=195} [2024-12-02 15:50:59,548 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 4 predicate places. [2024-12-02 15:50:59,549 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 195 transitions, 487 flow [2024-12-02 15:50:59,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:59,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:50:59,549 INFO L206 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] [2024-12-02 15:50:59,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-12-02 15:50:59,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 15:50:59,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:50:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1112232680, now seen corresponding path program 1 times [2024-12-02 15:50:59,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:50:59,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797125334] [2024-12-02 15:50:59,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:50:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:50:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:50:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:50:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:50:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797125334] [2024-12-02 15:50:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797125334] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:50:59,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:50:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:50:59,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190639637] [2024-12-02 15:50:59,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:50:59,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:50:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:50:59,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:50:59,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:50:59,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2024-12-02 15:50:59,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 195 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:50:59,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:50:59,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2024-12-02 15:50:59,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:51:25,972 INFO L124 PetriNetUnfolderBase]: 56512/186369 cut-off events. [2024-12-02 15:51:25,972 INFO L125 PetriNetUnfolderBase]: For 14085/14864 co-relation queries the response was YES. [2024-12-02 15:51:26,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282211 conditions, 186369 events. 56512/186369 cut-off events. For 14085/14864 co-relation queries the response was YES. Maximal size of possible extension queue 3534. Compared 2756763 event pairs, 39419 based on Foata normal form. 1/160277 useless extension candidates. Maximal degree in co-relation 152954. Up to 58232 conditions per place. [2024-12-02 15:51:27,305 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 32 selfloop transitions, 2 changer transitions 5/203 dead transitions. [2024-12-02 15:51:27,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 203 transitions, 581 flow [2024-12-02 15:51:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:51:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:51:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 994 transitions. [2024-12-02 15:51:27,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2024-12-02 15:51:27,307 INFO L175 Difference]: Start difference. First operand has 200 places, 195 transitions, 487 flow. Second operand 6 states and 994 transitions. [2024-12-02 15:51:27,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 203 transitions, 581 flow [2024-12-02 15:51:29,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 203 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:51:29,040 INFO L231 Difference]: Finished difference. Result has 206 places, 196 transitions, 495 flow [2024-12-02 15:51:29,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=206, PETRI_TRANSITIONS=196} [2024-12-02 15:51:29,041 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 10 predicate places. [2024-12-02 15:51:29,041 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 196 transitions, 495 flow [2024-12-02 15:51:29,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:51:29,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:51:29,041 INFO L206 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] [2024-12-02 15:51:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-12-02 15:51:29,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 15:51:29,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:51:29,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1323099025, now seen corresponding path program 1 times [2024-12-02 15:51:29,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:51:29,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167256103] [2024-12-02 15:51:29,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:51:29,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:51:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:51:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:51:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:51:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167256103] [2024-12-02 15:51:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167256103] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:51:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:51:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:51:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347371303] [2024-12-02 15:51:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:51:29,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:51:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:51:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:51:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:51:29,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-12-02 15:51:29,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 196 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:51:29,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:51:29,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-12-02 15:51:29,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:52:00,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [189#true, 193#true, 86#ULTIMATE.startFINALtrue, 91#L1027-3true, 191#true, Black: 199#true, 215#true, 197#true, 25#L1026-5true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 15#L1026-5true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), 195#true, Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 35#L1027-3true, 82#L1026-5true, 204#true]) [2024-12-02 15:52:00,566 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2024-12-02 15:52:00,566 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-12-02 15:52:00,566 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-12-02 15:52:00,566 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2024-12-02 15:52:11,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [24#L1025-3true, 189#true, 26#L1027-3true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, Black: 199#true, 215#true, 171#L1025-3true, 25#L1026-5true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 196#true, 204#true]) [2024-12-02 15:52:11,204 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2024-12-02 15:52:11,204 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-12-02 15:52:11,204 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-12-02 15:52:11,204 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-12-02 15:52:14,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [189#true, 26#L1027-3true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, 36#$Ultimate##0true, Black: 199#true, 215#true, 87#L1027-3true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 78#L1026-5true, 196#true, 204#true]) [2024-12-02 15:52:14,988 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2024-12-02 15:52:14,988 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-12-02 15:52:14,988 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-12-02 15:52:14,988 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-12-02 15:52:15,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [24#L1025-3true, 189#true, 26#L1027-3true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, Black: 199#true, 215#true, 25#L1026-5true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 35#L1027-3true, 196#true, 204#true]) [2024-12-02 15:52:15,672 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2024-12-02 15:52:15,672 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-12-02 15:52:15,672 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-12-02 15:52:15,672 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-12-02 15:52:15,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [189#true, 26#L1027-3true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, Black: 199#true, 215#true, 87#L1027-3true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 78#L1026-5true, 144#L1025-3true, 196#true, 204#true]) [2024-12-02 15:52:15,727 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2024-12-02 15:52:15,727 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-12-02 15:52:15,727 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-12-02 15:52:15,727 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-12-02 15:52:17,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [189#true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, Black: 199#true, 215#true, 87#L1027-3true, 25#L1026-5true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 15#L1026-5true, Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 35#L1027-3true, 196#true, 204#true]) [2024-12-02 15:52:17,276 INFO L294 olderBase$Statistics]: this new event has 264 ancestors and is cut-off event [2024-12-02 15:52:17,276 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-12-02 15:52:17,277 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-12-02 15:52:17,277 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2024-12-02 15:52:17,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([928] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_5|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_22|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_10|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|, ULTIMATE.start_main_~ts~0#1.offset=|v_ULTIMATE.start_main_~ts~0#1.offset_25|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_11|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_4|, ULTIMATE.start_main_#t~post14#1=|v_ULTIMATE.start_main_#t~post14#1_5|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_11|, ULTIMATE.start_main_~ts~0#1.base=|v_ULTIMATE.start_main_~ts~0#1.base_25|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_10|, ULTIMATE.start_main_#t~malloc9#1.base=|v_ULTIMATE.start_main_#t~malloc9#1.base_5|, ULTIMATE.start_main_#t~post18#1=|v_ULTIMATE.start_main_#t~post18#1_5|, ULTIMATE.start_main_#t~mem17#1.offset=|v_ULTIMATE.start_main_#t~mem17#1.offset_5|, ULTIMATE.start_main_#t~malloc9#1.offset=|v_ULTIMATE.start_main_#t~malloc9#1.offset_5|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_15|, ULTIMATE.start_main_#t~mem17#1.base=|v_ULTIMATE.start_main_#t~mem17#1.base_5|, ULTIMATE.start_main_~t~0#1.offset=|v_ULTIMATE.start_main_~t~0#1.offset_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_6|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_5|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_9|, ULTIMATE.start_main_~t~0#1.base=|v_ULTIMATE.start_main_~t~0#1.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_~ts~0#1.offset, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~post14#1, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_~ts~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~malloc9#1.base, ULTIMATE.start_main_#t~post18#1, ULTIMATE.start_main_#t~mem17#1.offset, ULTIMATE.start_main_#t~malloc9#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem17#1.base, ULTIMATE.start_main_~t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_~t~0#1.base][95], [26#L1027-3true, 189#true, 193#true, 86#ULTIMATE.startFINALtrue, 191#true, Black: 199#true, 215#true, 87#L1027-3true, Black: 208#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 195#true, Black: 206#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 207#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 78#L1026-5true, 160#L1027-3true, 196#true, 204#true]) [2024-12-02 15:52:17,943 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2024-12-02 15:52:17,943 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-12-02 15:52:17,943 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-12-02 15:52:17,943 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2024-12-02 15:52:24,014 INFO L124 PetriNetUnfolderBase]: 128148/377088 cut-off events. [2024-12-02 15:52:24,014 INFO L125 PetriNetUnfolderBase]: For 15392/15523 co-relation queries the response was YES. [2024-12-02 15:52:26,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576657 conditions, 377088 events. 128148/377088 cut-off events. For 15392/15523 co-relation queries the response was YES. Maximal size of possible extension queue 7101. Compared 5837891 event pairs, 105921 based on Foata normal form. 0/321449 useless extension candidates. Maximal degree in co-relation 576542. Up to 125931 conditions per place. [2024-12-02 15:52:27,466 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 85 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2024-12-02 15:52:27,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 235 transitions, 753 flow [2024-12-02 15:52:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:52:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:52:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2024-12-02 15:52:27,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031088082901554 [2024-12-02 15:52:27,467 INFO L175 Difference]: Start difference. First operand has 206 places, 196 transitions, 495 flow. Second operand 6 states and 930 transitions. [2024-12-02 15:52:27,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 235 transitions, 753 flow [2024-12-02 15:52:28,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 235 transitions, 741 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 15:52:28,605 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 491 flow [2024-12-02 15:52:28,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-12-02 15:52:28,605 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 7 predicate places. [2024-12-02 15:52:28,605 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 491 flow [2024-12-02 15:52:28,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:52:28,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:52:28,606 INFO L206 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] [2024-12-02 15:52:28,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-12-02 15:52:28,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-12-02 15:52:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:52:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2093512160, now seen corresponding path program 1 times [2024-12-02 15:52:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:52:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163876607] [2024-12-02 15:52:28,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:52:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:52:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:52:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:52:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:52:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163876607] [2024-12-02 15:52:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163876607] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:52:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:52:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:52:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133840771] [2024-12-02 15:52:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:52:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:52:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:52:28,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:52:28,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:52:28,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 193 [2024-12-02 15:52:28,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 144.0) internal successors, (864), 6 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:52:28,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:52:28,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 193 [2024-12-02 15:52:28,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand