./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fc7108df409edc784657349d4800f4e95b31456bbad21a9a39e0cf26181ca6f5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:28,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:28,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:28,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:28,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:28,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:28,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:28,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:28,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:28,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:28,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:28,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:28,105 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:28,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:28,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:28,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:28,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:28,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:28,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:28,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:28,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:28,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:28,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:28,109 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fc7108df409edc784657349d4800f4e95b31456bbad21a9a39e0cf26181ca6f5 [2025-04-29 11:08:28,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:28,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:28,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:28,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:28,361 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:28,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.c [2025-04-29 11:08:29,701 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012600ba/e36841e3eef646b897687bb92697118d/FLAG749e43c1e [2025-04-29 11:08:29,922 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:29,923 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.c [2025-04-29 11:08:29,925 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:29,925 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:29,931 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012600ba/e36841e3eef646b897687bb92697118d/FLAG749e43c1e [2025-04-29 11:08:30,752 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c012600ba/e36841e3eef646b897687bb92697118d [2025-04-29 11:08:30,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:30,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:30,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:30,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:30,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:30,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:30,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2b5895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30, skipping insertion in model container [2025-04-29 11:08:30,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:30,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:30,904 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:30,912 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:30,942 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:30,958 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:30,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30 WrapperNode [2025-04-29 11:08:30,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:30,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:30,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:30,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:30,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:30,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:30,991 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2025-04-29 11:08:30,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:30,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:30,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:30,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:31,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:31,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:31,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:31,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:31,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (1/1) ... [2025-04-29 11:08:31,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:31,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:31,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:31,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:31,072 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:31,131 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:31,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:31,318 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:31,318 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:31,341 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:31,341 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:31,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:31 BoogieIcfgContainer [2025-04-29 11:08:31,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:31,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:31,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:31,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:31,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:30" (1/3) ... [2025-04-29 11:08:31,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdb5fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:31, skipping insertion in model container [2025-04-29 11:08:31,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:30" (2/3) ... [2025-04-29 11:08:31,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdb5fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:31, skipping insertion in model container [2025-04-29 11:08:31,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:31" (3/3) ... [2025-04-29 11:08:31,349 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.c [2025-04-29 11:08:31,359 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:31,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_07-tricky_address2.c that has 2 procedures, 118 locations, 119 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-29 11:08:31,361 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:31,422 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 120 transitions, 244 flow [2025-04-29 11:08:31,492 INFO L116 PetriNetUnfolderBase]: 3/119 cut-off events. [2025-04-29 11:08:31,494 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:31,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2025-04-29 11:08:31,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 120 transitions, 244 flow [2025-04-29 11:08:31,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 119 transitions, 241 flow [2025-04-29 11:08:31,504 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:31,512 INFO L340 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;@1e7a602b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:31,512 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:31,530 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:31,531 INFO L116 PetriNetUnfolderBase]: 3/71 cut-off events. [2025-04-29 11:08:31,531 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:31,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,531 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] [2025-04-29 11:08:31,532 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:31,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -786000854, now seen corresponding path program 1 times [2025-04-29 11:08:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245970556] [2025-04-29 11:08:31,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:08:31,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:08:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:31,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245970556] [2025-04-29 11:08:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245970556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:31,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813950776] [2025-04-29 11:08:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:31,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:31,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:31,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2025-04-29 11:08:31,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:31,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:31,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2025-04-29 11:08:31,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:31,933 INFO L116 PetriNetUnfolderBase]: 7/181 cut-off events. [2025-04-29 11:08:31,933 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:31,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 181 events. 7/181 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 324 event pairs, 6 based on Foata normal form. 5/174 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2025-04-29 11:08:31,936 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 10 selfloop transitions, 2 changer transitions 1/118 dead transitions. [2025-04-29 11:08:31,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 263 flow [2025-04-29 11:08:31,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-04-29 11:08:31,950 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:08:31,952 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 241 flow. Second operand 3 states and 336 transitions. [2025-04-29 11:08:31,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 263 flow [2025-04-29 11:08:31,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 118 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:31,962 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 246 flow [2025-04-29 11:08:31,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-04-29 11:08:31,968 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2025-04-29 11:08:31,968 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 246 flow [2025-04-29 11:08:31,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:31,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,970 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] [2025-04-29 11:08:31,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:31,970 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:31,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1729146193, now seen corresponding path program 1 times [2025-04-29 11:08:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145165215] [2025-04-29 11:08:31,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:31,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:31,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:31,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:32,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145165215] [2025-04-29 11:08:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145165215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:32,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240325611] [2025-04-29 11:08:32,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:32,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:32,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:32,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:08:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:08:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:32,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:32,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:32,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240325611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:32,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:32,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525155152] [2025-04-29 11:08:32,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:32,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:32,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:32,322 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:32,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:32,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:32,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:32,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:32,434 INFO L116 PetriNetUnfolderBase]: 7/187 cut-off events. [2025-04-29 11:08:32,434 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:32,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 187 events. 7/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 317 event pairs, 6 based on Foata normal form. 2/178 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2025-04-29 11:08:32,439 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 14 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-04-29 11:08:32,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 125 transitions, 310 flow [2025-04-29 11:08:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 961 transitions. [2025-04-29 11:08:32,443 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8898148148148148 [2025-04-29 11:08:32,443 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 246 flow. Second operand 9 states and 961 transitions. [2025-04-29 11:08:32,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 125 transitions, 310 flow [2025-04-29 11:08:32,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:32,446 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 294 flow [2025-04-29 11:08:32,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=244, 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=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=294, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2025-04-29 11:08:32,446 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places. [2025-04-29 11:08:32,446 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 294 flow [2025-04-29 11:08:32,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:32,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:32,449 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:32,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:08:32,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:32,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:32,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1327889295, now seen corresponding path program 2 times [2025-04-29 11:08:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:32,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461870123] [2025-04-29 11:08:32,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:32,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-29 11:08:32,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 69 statements. [2025-04-29 11:08:32,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:33,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461870123] [2025-04-29 11:08:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461870123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677803952] [2025-04-29 11:08:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:33,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:33,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:33,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:33,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 120 [2025-04-29 11:08:33,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:33,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 120 [2025-04-29 11:08:33,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:33,455 INFO L116 PetriNetUnfolderBase]: 129/614 cut-off events. [2025-04-29 11:08:33,456 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:33,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 614 events. 129/614 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3507 event pairs, 58 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 871. Up to 178 conditions per place. [2025-04-29 11:08:33,463 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 43 selfloop transitions, 22 changer transitions 0/164 dead transitions. [2025-04-29 11:08:33,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 164 transitions, 506 flow [2025-04-29 11:08:33,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2025-04-29 11:08:33,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-04-29 11:08:33,465 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 294 flow. Second operand 6 states and 630 transitions. [2025-04-29 11:08:33,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 164 transitions, 506 flow [2025-04-29 11:08:33,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 164 transitions, 500 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:33,485 INFO L231 Difference]: Finished difference. Result has 139 places, 145 transitions, 434 flow [2025-04-29 11:08:33,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=139, PETRI_TRANSITIONS=145} [2025-04-29 11:08:33,486 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 19 predicate places. [2025-04-29 11:08:33,486 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 145 transitions, 434 flow [2025-04-29 11:08:33,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:33,487 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:33,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:33,487 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:33,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1474340804, now seen corresponding path program 1 times [2025-04-29 11:08:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:33,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738003845] [2025-04-29 11:08:33,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:33,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:33,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:33,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:33,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:33,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738003845] [2025-04-29 11:08:33,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738003845] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:33,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073126761] [2025-04-29 11:08:33,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:33,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:33,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:33,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:33,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:08:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:08:33,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:08:33,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:33,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:33,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:33,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:33,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073126761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:33,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:33,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138270477] [2025-04-29 11:08:33,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:33,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:33,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:33,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:33,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 145 transitions, 434 flow. Second operand has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:33,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:33,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:33,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:34,121 INFO L116 PetriNetUnfolderBase]: 41/463 cut-off events. [2025-04-29 11:08:34,122 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-29 11:08:34,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 463 events. 41/463 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2249 event pairs, 16 based on Foata normal form. 4/440 useless extension candidates. Maximal degree in co-relation 626. Up to 55 conditions per place. [2025-04-29 11:08:34,125 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 18 selfloop transitions, 21 changer transitions 0/163 dead transitions. [2025-04-29 11:08:34,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 163 transitions, 600 flow [2025-04-29 11:08:34,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2227 transitions. [2025-04-29 11:08:34,131 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8837301587301587 [2025-04-29 11:08:34,131 INFO L175 Difference]: Start difference. First operand has 139 places, 145 transitions, 434 flow. Second operand 21 states and 2227 transitions. [2025-04-29 11:08:34,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 163 transitions, 600 flow [2025-04-29 11:08:34,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 163 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:34,138 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 564 flow [2025-04-29 11:08:34,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=564, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-04-29 11:08:34,140 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 44 predicate places. [2025-04-29 11:08:34,140 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 564 flow [2025-04-29 11:08:34,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 106.0) internal successors, (1908), 18 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:34,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:34,141 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:34,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:08:34,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:08:34,342 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:34,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1088151044, now seen corresponding path program 2 times [2025-04-29 11:08:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:34,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105919889] [2025-04-29 11:08:34,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:34,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-04-29 11:08:34,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 97 statements. [2025-04-29 11:08:34,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:34,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-29 11:08:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:34,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105919889] [2025-04-29 11:08:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105919889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663554399] [2025-04-29 11:08:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:34,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:34,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:34,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:34,791 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2025-04-29 11:08:34,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:34,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:34,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2025-04-29 11:08:34,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:35,051 INFO L116 PetriNetUnfolderBase]: 306/1295 cut-off events. [2025-04-29 11:08:35,051 INFO L117 PetriNetUnfolderBase]: For 284/294 co-relation queries the response was YES. [2025-04-29 11:08:35,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2462 conditions, 1295 events. 306/1295 cut-off events. For 284/294 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9036 event pairs, 116 based on Foata normal form. 5/1188 useless extension candidates. Maximal degree in co-relation 2305. Up to 464 conditions per place. [2025-04-29 11:08:35,057 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 72 selfloop transitions, 36 changer transitions 2/215 dead transitions. [2025-04-29 11:08:35,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 215 transitions, 936 flow [2025-04-29 11:08:35,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-04-29 11:08:35,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2025-04-29 11:08:35,059 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 564 flow. Second operand 6 states and 616 transitions. [2025-04-29 11:08:35,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 215 transitions, 936 flow [2025-04-29 11:08:35,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 215 transitions, 912 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:35,063 INFO L231 Difference]: Finished difference. Result has 167 places, 190 transitions, 792 flow [2025-04-29 11:08:35,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=167, PETRI_TRANSITIONS=190} [2025-04-29 11:08:35,064 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 47 predicate places. [2025-04-29 11:08:35,064 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 190 transitions, 792 flow [2025-04-29 11:08:35,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:35,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:35,065 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:35,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:35,065 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:35,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -187517879, now seen corresponding path program 1 times [2025-04-29 11:08:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:35,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770835870] [2025-04-29 11:08:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:35,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:35,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:35,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770835870] [2025-04-29 11:08:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770835870] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:35,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885124518] [2025-04-29 11:08:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:35,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:35,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:08:35,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-29 11:08:35,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-29 11:08:35,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:35,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885124518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:35,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972998897] [2025-04-29 11:08:35,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:35,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:35,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:35,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:35,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-04-29 11:08:35,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 190 transitions, 792 flow. Second operand has 23 states, 23 states have (on average 106.08695652173913) internal successors, (2440), 23 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:35,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-04-29 11:08:35,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:35,998 INFO L116 PetriNetUnfolderBase]: 120/895 cut-off events. [2025-04-29 11:08:35,998 INFO L117 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-04-29 11:08:36,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 895 events. 120/895 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5976 event pairs, 33 based on Foata normal form. 3/839 useless extension candidates. Maximal degree in co-relation 1557. Up to 134 conditions per place. [2025-04-29 11:08:36,004 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 21 selfloop transitions, 30 changer transitions 0/207 dead transitions. [2025-04-29 11:08:36,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 207 transitions, 1016 flow [2025-04-29 11:08:36,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3174 transitions. [2025-04-29 11:08:36,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8816666666666667 [2025-04-29 11:08:36,010 INFO L175 Difference]: Start difference. First operand has 167 places, 190 transitions, 792 flow. Second operand 30 states and 3174 transitions. [2025-04-29 11:08:36,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 207 transitions, 1016 flow [2025-04-29 11:08:36,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 992 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:36,018 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 920 flow [2025-04-29 11:08:36,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=920, PETRI_PLACES=199, PETRI_TRANSITIONS=200} [2025-04-29 11:08:36,020 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 79 predicate places. [2025-04-29 11:08:36,021 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 920 flow [2025-04-29 11:08:36,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 106.08695652173913) internal successors, (2440), 23 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:36,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:36,022 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:36,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:08:36,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:36,223 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:36,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash -279343868, now seen corresponding path program 2 times [2025-04-29 11:08:36,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452938148] [2025-04-29 11:08:36,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-29 11:08:36,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 114 statements. [2025-04-29 11:08:36,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:36,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:36,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452938148] [2025-04-29 11:08:36,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452938148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:36,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707363718] [2025-04-29 11:08:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:36,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:36,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:36,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:36,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2025-04-29 11:08:36,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:36,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:36,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2025-04-29 11:08:36,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:36,888 INFO L116 PetriNetUnfolderBase]: 300/1387 cut-off events. [2025-04-29 11:08:36,889 INFO L117 PetriNetUnfolderBase]: For 879/919 co-relation queries the response was YES. [2025-04-29 11:08:36,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1387 events. 300/1387 cut-off events. For 879/919 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10116 event pairs, 66 based on Foata normal form. 10/1351 useless extension candidates. Maximal degree in co-relation 2983. Up to 443 conditions per place. [2025-04-29 11:08:36,897 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 79 selfloop transitions, 49 changer transitions 0/266 dead transitions. [2025-04-29 11:08:36,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 266 transitions, 1475 flow [2025-04-29 11:08:36,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2025-04-29 11:08:36,899 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-04-29 11:08:36,899 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 920 flow. Second operand 6 states and 640 transitions. [2025-04-29 11:08:36,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 266 transitions, 1475 flow [2025-04-29 11:08:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 266 transitions, 1429 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:36,907 INFO L231 Difference]: Finished difference. Result has 190 places, 241 transitions, 1290 flow [2025-04-29 11:08:36,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1290, PETRI_PLACES=190, PETRI_TRANSITIONS=241} [2025-04-29 11:08:36,909 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 70 predicate places. [2025-04-29 11:08:36,910 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 241 transitions, 1290 flow [2025-04-29 11:08:36,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:36,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:36,910 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:36,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:36,910 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:36,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1927687799, now seen corresponding path program 1 times [2025-04-29 11:08:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856218557] [2025-04-29 11:08:36,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:08:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:08:36,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:37,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856218557] [2025-04-29 11:08:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856218557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:37,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:37,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:37,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388210192] [2025-04-29 11:08:37,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:37,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:37,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:37,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:37,396 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 120 [2025-04-29 11:08:37,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 241 transitions, 1290 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:37,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:37,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 120 [2025-04-29 11:08:37,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:37,666 INFO L116 PetriNetUnfolderBase]: 569/2163 cut-off events. [2025-04-29 11:08:37,666 INFO L117 PetriNetUnfolderBase]: For 2443/2506 co-relation queries the response was YES. [2025-04-29 11:08:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2163 events. 569/2163 cut-off events. For 2443/2506 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17203 event pairs, 130 based on Foata normal form. 12/2090 useless extension candidates. Maximal degree in co-relation 5572. Up to 803 conditions per place. [2025-04-29 11:08:37,678 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 118 selfloop transitions, 78 changer transitions 11/335 dead transitions. [2025-04-29 11:08:37,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 335 transitions, 2228 flow [2025-04-29 11:08:37,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-04-29 11:08:37,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8694444444444445 [2025-04-29 11:08:37,680 INFO L175 Difference]: Start difference. First operand has 190 places, 241 transitions, 1290 flow. Second operand 6 states and 626 transitions. [2025-04-29 11:08:37,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 335 transitions, 2228 flow [2025-04-29 11:08:37,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 335 transitions, 2226 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:37,696 INFO L231 Difference]: Finished difference. Result has 199 places, 289 transitions, 1894 flow [2025-04-29 11:08:37,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1894, PETRI_PLACES=199, PETRI_TRANSITIONS=289} [2025-04-29 11:08:37,697 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 79 predicate places. [2025-04-29 11:08:37,697 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 289 transitions, 1894 flow [2025-04-29 11:08:37,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:37,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:37,699 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:37,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:37,699 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:37,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:37,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1830232476, now seen corresponding path program 1 times [2025-04-29 11:08:37,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:37,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019178052] [2025-04-29 11:08:37,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:37,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:37,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:08:37,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:37,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:37,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:38,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019178052] [2025-04-29 11:08:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019178052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591822476] [2025-04-29 11:08:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:38,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:38,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:38,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:38,677 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:08:38,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 289 transitions, 1894 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:38,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:38,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:08:38,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,505 INFO L116 PetriNetUnfolderBase]: 1231/4485 cut-off events. [2025-04-29 11:08:39,505 INFO L117 PetriNetUnfolderBase]: For 9345/9586 co-relation queries the response was YES. [2025-04-29 11:08:39,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14358 conditions, 4485 events. 1231/4485 cut-off events. For 9345/9586 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 42365 event pairs, 134 based on Foata normal form. 159/4593 useless extension candidates. Maximal degree in co-relation 14121. Up to 893 conditions per place. [2025-04-29 11:08:39,533 INFO L140 encePairwiseOnDemand]: 98/120 looper letters, 363 selfloop transitions, 78 changer transitions 91/655 dead transitions. [2025-04-29 11:08:39,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 655 transitions, 6013 flow [2025-04-29 11:08:39,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:08:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:08:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1370 transitions. [2025-04-29 11:08:39,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2025-04-29 11:08:39,537 INFO L175 Difference]: Start difference. First operand has 199 places, 289 transitions, 1894 flow. Second operand 14 states and 1370 transitions. [2025-04-29 11:08:39,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 655 transitions, 6013 flow [2025-04-29 11:08:39,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 655 transitions, 5927 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:39,579 INFO L231 Difference]: Finished difference. Result has 223 places, 362 transitions, 2933 flow [2025-04-29 11:08:39,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2933, PETRI_PLACES=223, PETRI_TRANSITIONS=362} [2025-04-29 11:08:39,581 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 103 predicate places. [2025-04-29 11:08:39,581 INFO L485 AbstractCegarLoop]: Abstraction has has 223 places, 362 transitions, 2933 flow [2025-04-29 11:08:39,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:39,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,581 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:39,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:39,581 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:39,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 534261554, now seen corresponding path program 2 times [2025-04-29 11:08:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811752185] [2025-04-29 11:08:39,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:39,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:39,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:40,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811752185] [2025-04-29 11:08:40,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811752185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:40,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952019848] [2025-04-29 11:08:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:40,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:40,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:40,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:40,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:08:40,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 362 transitions, 2933 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:40,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:08:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,484 INFO L116 PetriNetUnfolderBase]: 1202/4400 cut-off events. [2025-04-29 11:08:41,485 INFO L117 PetriNetUnfolderBase]: For 13741/14018 co-relation queries the response was YES. [2025-04-29 11:08:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16329 conditions, 4400 events. 1202/4400 cut-off events. For 13741/14018 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 41842 event pairs, 193 based on Foata normal form. 164/4512 useless extension candidates. Maximal degree in co-relation 16081. Up to 1311 conditions per place. [2025-04-29 11:08:41,518 INFO L140 encePairwiseOnDemand]: 99/120 looper letters, 306 selfloop transitions, 112 changer transitions 60/601 dead transitions. [2025-04-29 11:08:41,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 601 transitions, 6120 flow [2025-04-29 11:08:41,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:08:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:08:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1159 transitions. [2025-04-29 11:08:41,520 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8048611111111111 [2025-04-29 11:08:41,520 INFO L175 Difference]: Start difference. First operand has 223 places, 362 transitions, 2933 flow. Second operand 12 states and 1159 transitions. [2025-04-29 11:08:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 601 transitions, 6120 flow [2025-04-29 11:08:41,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 601 transitions, 6114 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:41,609 INFO L231 Difference]: Finished difference. Result has 238 places, 397 transitions, 3739 flow [2025-04-29 11:08:41,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3739, PETRI_PLACES=238, PETRI_TRANSITIONS=397} [2025-04-29 11:08:41,610 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 118 predicate places. [2025-04-29 11:08:41,610 INFO L485 AbstractCegarLoop]: Abstraction has has 238 places, 397 transitions, 3739 flow [2025-04-29 11:08:41,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:41,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:41,611 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:41,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:41,611 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:41,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 203494106, now seen corresponding path program 3 times [2025-04-29 11:08:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:41,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064659336] [2025-04-29 11:08:41,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:41,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:41,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:41,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:42,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064659336] [2025-04-29 11:08:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064659336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628216931] [2025-04-29 11:08:42,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:42,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:42,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:42,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:42,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:08:42,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 397 transitions, 3739 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:42,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:42,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:08:42,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:43,558 INFO L116 PetriNetUnfolderBase]: 1894/6412 cut-off events. [2025-04-29 11:08:43,558 INFO L117 PetriNetUnfolderBase]: For 32695/33113 co-relation queries the response was YES. [2025-04-29 11:08:43,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27923 conditions, 6412 events. 1894/6412 cut-off events. For 32695/33113 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 65130 event pairs, 256 based on Foata normal form. 190/6521 useless extension candidates. Maximal degree in co-relation 27667. Up to 1364 conditions per place. [2025-04-29 11:08:43,668 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 539 selfloop transitions, 111 changer transitions 40/813 dead transitions. [2025-04-29 11:08:43,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 813 transitions, 9772 flow [2025-04-29 11:08:43,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:08:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:08:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-04-29 11:08:43,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-04-29 11:08:43,670 INFO L175 Difference]: Start difference. First operand has 238 places, 397 transitions, 3739 flow. Second operand 12 states and 1184 transitions. [2025-04-29 11:08:43,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 813 transitions, 9772 flow [2025-04-29 11:08:43,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 813 transitions, 9647 flow, removed 49 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:43,808 INFO L231 Difference]: Finished difference. Result has 247 places, 476 transitions, 5273 flow [2025-04-29 11:08:43,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=3678, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5273, PETRI_PLACES=247, PETRI_TRANSITIONS=476} [2025-04-29 11:08:43,809 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 127 predicate places. [2025-04-29 11:08:43,809 INFO L485 AbstractCegarLoop]: Abstraction has has 247 places, 476 transitions, 5273 flow [2025-04-29 11:08:43,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:43,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:43,810 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:43,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:43,810 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:43,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1306315414, now seen corresponding path program 4 times [2025-04-29 11:08:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:43,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904075815] [2025-04-29 11:08:43,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:43,822 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:08:43,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:08:43,837 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:43,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:44,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904075815] [2025-04-29 11:08:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904075815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444838735] [2025-04-29 11:08:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:44,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:44,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:44,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:44,797 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:08:44,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 476 transitions, 5273 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:44,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:44,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:08:44,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:46,166 INFO L116 PetriNetUnfolderBase]: 2069/7076 cut-off events. [2025-04-29 11:08:46,166 INFO L117 PetriNetUnfolderBase]: For 42213/42688 co-relation queries the response was YES. [2025-04-29 11:08:46,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31997 conditions, 7076 events. 2069/7076 cut-off events. For 42213/42688 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 73944 event pairs, 305 based on Foata normal form. 346/7349 useless extension candidates. Maximal degree in co-relation 31737. Up to 1502 conditions per place. [2025-04-29 11:08:46,222 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 241 selfloop transitions, 241 changer transitions 48/653 dead transitions. [2025-04-29 11:08:46,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 653 transitions, 8125 flow [2025-04-29 11:08:46,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:08:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:08:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2025-04-29 11:08:46,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8013888888888889 [2025-04-29 11:08:46,224 INFO L175 Difference]: Start difference. First operand has 247 places, 476 transitions, 5273 flow. Second operand 12 states and 1154 transitions. [2025-04-29 11:08:46,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 653 transitions, 8125 flow [2025-04-29 11:08:46,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 653 transitions, 7999 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:46,435 INFO L231 Difference]: Finished difference. Result has 264 places, 508 transitions, 6374 flow [2025-04-29 11:08:46,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=5176, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6374, PETRI_PLACES=264, PETRI_TRANSITIONS=508} [2025-04-29 11:08:46,435 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 144 predicate places. [2025-04-29 11:08:46,435 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 508 transitions, 6374 flow [2025-04-29 11:08:46,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:46,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:46,436 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:46,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:46,436 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:46,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1206272968, now seen corresponding path program 5 times [2025-04-29 11:08:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:46,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552505370] [2025-04-29 11:08:46,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:46,447 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:46,509 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:46,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552505370] [2025-04-29 11:08:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552505370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:49,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51613414] [2025-04-29 11:08:49,769 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:49,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:49,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:49,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:08:49,822 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:49,873 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:49,873 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:49,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-29 11:08:49,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:49,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-29 11:08:50,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:08:50,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:08:50,213 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:08:50,214 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-04-29 11:08:50,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:50,222 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:08:50,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:08:50,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:08:50,282 INFO L325 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-04-29 11:08:50,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 71 [2025-04-29 11:08:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-04-29 11:08:50,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:50,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-04-29 11:08:50,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-04-29 11:08:50,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-04-29 11:08:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51613414] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:50,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:08:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [32, 21] total 44 [2025-04-29 11:08:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567656253] [2025-04-29 11:08:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:50,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:50,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:50,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1814, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:08:51,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 120 [2025-04-29 11:08:51,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 508 transitions, 6374 flow. Second operand has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:51,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 120 [2025-04-29 11:08:51,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,321 INFO L116 PetriNetUnfolderBase]: 2878/8831 cut-off events. [2025-04-29 11:08:53,321 INFO L117 PetriNetUnfolderBase]: For 63296/63938 co-relation queries the response was YES. [2025-04-29 11:08:53,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42404 conditions, 8831 events. 2878/8831 cut-off events. For 63296/63938 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 90939 event pairs, 252 based on Foata normal form. 219/8950 useless extension candidates. Maximal degree in co-relation 42136. Up to 1750 conditions per place. [2025-04-29 11:08:53,389 INFO L140 encePairwiseOnDemand]: 94/120 looper letters, 548 selfloop transitions, 252 changer transitions 75/988 dead transitions. [2025-04-29 11:08:53,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 988 transitions, 12945 flow [2025-04-29 11:08:53,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:08:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:08:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1549 transitions. [2025-04-29 11:08:53,391 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8067708333333333 [2025-04-29 11:08:53,391 INFO L175 Difference]: Start difference. First operand has 264 places, 508 transitions, 6374 flow. Second operand 16 states and 1549 transitions. [2025-04-29 11:08:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 988 transitions, 12945 flow [2025-04-29 11:08:53,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 988 transitions, 12850 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:53,722 INFO L231 Difference]: Finished difference. Result has 288 places, 610 transitions, 8971 flow [2025-04-29 11:08:53,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=6303, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=8971, PETRI_PLACES=288, PETRI_TRANSITIONS=610} [2025-04-29 11:08:53,723 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 168 predicate places. [2025-04-29 11:08:53,723 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 610 transitions, 8971 flow [2025-04-29 11:08:53,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:53,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,723 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:53,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:53,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:53,924 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:53,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -294550448, now seen corresponding path program 6 times [2025-04-29 11:08:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496404309] [2025-04-29 11:08:53,925 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:08:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:08:53,940 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:08:53,940 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:08:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:54,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496404309] [2025-04-29 11:08:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496404309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081285566] [2025-04-29 11:08:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:54,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:54,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:54,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:55,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:08:55,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 610 transitions, 8971 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:55,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:55,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:08:55,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:56,827 INFO L116 PetriNetUnfolderBase]: 2645/8756 cut-off events. [2025-04-29 11:08:56,828 INFO L117 PetriNetUnfolderBase]: For 87891/88540 co-relation queries the response was YES. [2025-04-29 11:08:56,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46453 conditions, 8756 events. 2645/8756 cut-off events. For 87891/88540 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 93581 event pairs, 472 based on Foata normal form. 285/8921 useless extension candidates. Maximal degree in co-relation 46174. Up to 1911 conditions per place. [2025-04-29 11:08:56,905 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 431 selfloop transitions, 221 changer transitions 23/801 dead transitions. [2025-04-29 11:08:56,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 801 transitions, 12530 flow [2025-04-29 11:08:56,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:08:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:08:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1170 transitions. [2025-04-29 11:08:56,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-04-29 11:08:56,911 INFO L175 Difference]: Start difference. First operand has 288 places, 610 transitions, 8971 flow. Second operand 12 states and 1170 transitions. [2025-04-29 11:08:56,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 801 transitions, 12530 flow [2025-04-29 11:08:57,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 801 transitions, 12257 flow, removed 86 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:57,314 INFO L231 Difference]: Finished difference. Result has 300 places, 629 transitions, 9702 flow [2025-04-29 11:08:57,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=8724, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9702, PETRI_PLACES=300, PETRI_TRANSITIONS=629} [2025-04-29 11:08:57,314 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 180 predicate places. [2025-04-29 11:08:57,314 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 629 transitions, 9702 flow [2025-04-29 11:08:57,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:57,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:57,315 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:57,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:57,319 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:57,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1386535679, now seen corresponding path program 1 times [2025-04-29 11:08:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:57,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692528325] [2025-04-29 11:08:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:57,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:08:57,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:08:57,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:57,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:57,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692528325] [2025-04-29 11:08:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692528325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283799704] [2025-04-29 11:08:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:57,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:57,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:57,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:58,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 120 [2025-04-29 11:08:58,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 629 transitions, 9702 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:58,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:58,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 120 [2025-04-29 11:08:58,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:59,579 INFO L116 PetriNetUnfolderBase]: 2300/8190 cut-off events. [2025-04-29 11:08:59,579 INFO L117 PetriNetUnfolderBase]: For 93973/94833 co-relation queries the response was YES. [2025-04-29 11:08:59,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43653 conditions, 8190 events. 2300/8190 cut-off events. For 93973/94833 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 90517 event pairs, 256 based on Foata normal form. 337/8430 useless extension candidates. Maximal degree in co-relation 43370. Up to 1518 conditions per place. [2025-04-29 11:08:59,629 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 567 selfloop transitions, 119 changer transitions 41/935 dead transitions. [2025-04-29 11:08:59,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 935 transitions, 15731 flow [2025-04-29 11:08:59,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1103 transitions. [2025-04-29 11:08:59,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8356060606060606 [2025-04-29 11:08:59,631 INFO L175 Difference]: Start difference. First operand has 300 places, 629 transitions, 9702 flow. Second operand 11 states and 1103 transitions. [2025-04-29 11:08:59,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 935 transitions, 15731 flow [2025-04-29 11:09:00,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 935 transitions, 15421 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:00,026 INFO L231 Difference]: Finished difference. Result has 311 places, 701 transitions, 10809 flow [2025-04-29 11:09:00,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=9448, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10809, PETRI_PLACES=311, PETRI_TRANSITIONS=701} [2025-04-29 11:09:00,027 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 191 predicate places. [2025-04-29 11:09:00,027 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 701 transitions, 10809 flow [2025-04-29 11:09:00,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:00,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:00,028 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:00,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:09:00,028 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:00,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash 641627484, now seen corresponding path program 7 times [2025-04-29 11:09:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:00,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789088520] [2025-04-29 11:09:00,028 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:00,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:09:00,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:00,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:00,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:00,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789088520] [2025-04-29 11:09:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789088520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491261708] [2025-04-29 11:09:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:00,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:00,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:00,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:01,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:01,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 701 transitions, 10809 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:01,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:01,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:01,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:03,250 INFO L116 PetriNetUnfolderBase]: 2612/8986 cut-off events. [2025-04-29 11:09:03,250 INFO L117 PetriNetUnfolderBase]: For 100478/101087 co-relation queries the response was YES. [2025-04-29 11:09:03,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48712 conditions, 8986 events. 2612/8986 cut-off events. For 100478/101087 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 98036 event pairs, 465 based on Foata normal form. 221/9080 useless extension candidates. Maximal degree in co-relation 48423. Up to 1986 conditions per place. [2025-04-29 11:09:03,328 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 552 selfloop transitions, 196 changer transitions 33/917 dead transitions. [2025-04-29 11:09:03,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 917 transitions, 15315 flow [2025-04-29 11:09:03,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:09:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:09:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1171 transitions. [2025-04-29 11:09:03,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8131944444444444 [2025-04-29 11:09:03,334 INFO L175 Difference]: Start difference. First operand has 311 places, 701 transitions, 10809 flow. Second operand 12 states and 1171 transitions. [2025-04-29 11:09:03,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 917 transitions, 15315 flow [2025-04-29 11:09:03,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 917 transitions, 15235 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:03,844 INFO L231 Difference]: Finished difference. Result has 328 places, 727 transitions, 11973 flow [2025-04-29 11:09:03,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=10729, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11973, PETRI_PLACES=328, PETRI_TRANSITIONS=727} [2025-04-29 11:09:03,845 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 208 predicate places. [2025-04-29 11:09:03,845 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 727 transitions, 11973 flow [2025-04-29 11:09:03,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:03,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:03,845 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:03,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:03,845 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:03,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -395331342, now seen corresponding path program 8 times [2025-04-29 11:09:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:03,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179109218] [2025-04-29 11:09:03,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:03,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:03,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:03,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:03,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:04,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179109218] [2025-04-29 11:09:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179109218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756036608] [2025-04-29 11:09:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:04,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:04,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:04,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:04,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 727 transitions, 11973 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:04,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:04,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:04,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:07,039 INFO L116 PetriNetUnfolderBase]: 2600/8917 cut-off events. [2025-04-29 11:09:07,040 INFO L117 PetriNetUnfolderBase]: For 110518/111124 co-relation queries the response was YES. [2025-04-29 11:09:07,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49991 conditions, 8917 events. 2600/8917 cut-off events. For 110518/111124 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 96909 event pairs, 385 based on Foata normal form. 251/9047 useless extension candidates. Maximal degree in co-relation 49695. Up to 1986 conditions per place. [2025-04-29 11:09:07,271 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 624 selfloop transitions, 200 changer transitions 34/994 dead transitions. [2025-04-29 11:09:07,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 994 transitions, 17230 flow [2025-04-29 11:09:07,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:09:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:09:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1179 transitions. [2025-04-29 11:09:07,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.81875 [2025-04-29 11:09:07,272 INFO L175 Difference]: Start difference. First operand has 328 places, 727 transitions, 11973 flow. Second operand 12 states and 1179 transitions. [2025-04-29 11:09:07,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 994 transitions, 17230 flow [2025-04-29 11:09:07,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 994 transitions, 17043 flow, removed 62 selfloop flow, removed 3 redundant places. [2025-04-29 11:09:07,785 INFO L231 Difference]: Finished difference. Result has 340 places, 762 transitions, 13312 flow [2025-04-29 11:09:07,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=11793, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13312, PETRI_PLACES=340, PETRI_TRANSITIONS=762} [2025-04-29 11:09:07,786 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 220 predicate places. [2025-04-29 11:09:07,786 INFO L485 AbstractCegarLoop]: Abstraction has has 340 places, 762 transitions, 13312 flow [2025-04-29 11:09:07,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:07,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:07,787 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:07,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:09:07,787 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:07,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2007867214, now seen corresponding path program 9 times [2025-04-29 11:09:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:07,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707708461] [2025-04-29 11:09:07,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:07,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:07,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:07,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:09:07,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:08,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707708461] [2025-04-29 11:09:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707708461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125900088] [2025-04-29 11:09:08,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:08,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:08,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:08,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:08,527 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:08,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 762 transitions, 13312 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:08,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:08,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:08,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:10,639 INFO L116 PetriNetUnfolderBase]: 2577/8880 cut-off events. [2025-04-29 11:09:10,639 INFO L117 PetriNetUnfolderBase]: For 121260/121839 co-relation queries the response was YES. [2025-04-29 11:09:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50836 conditions, 8880 events. 2577/8880 cut-off events. For 121260/121839 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 96461 event pairs, 429 based on Foata normal form. 226/8982 useless extension candidates. Maximal degree in co-relation 50536. Up to 1961 conditions per place. [2025-04-29 11:09:10,742 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 641 selfloop transitions, 181 changer transitions 44/999 dead transitions. [2025-04-29 11:09:10,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 999 transitions, 17812 flow [2025-04-29 11:09:10,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:09:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:09:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1711 transitions. [2025-04-29 11:09:10,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7921296296296296 [2025-04-29 11:09:10,744 INFO L175 Difference]: Start difference. First operand has 340 places, 762 transitions, 13312 flow. Second operand 18 states and 1711 transitions. [2025-04-29 11:09:10,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 999 transitions, 17812 flow [2025-04-29 11:09:11,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 999 transitions, 17607 flow, removed 45 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:11,443 INFO L231 Difference]: Finished difference. Result has 360 places, 760 transitions, 13652 flow [2025-04-29 11:09:11,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=13139, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=13652, PETRI_PLACES=360, PETRI_TRANSITIONS=760} [2025-04-29 11:09:11,443 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 240 predicate places. [2025-04-29 11:09:11,443 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 760 transitions, 13652 flow [2025-04-29 11:09:11,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:11,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:11,444 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:11,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:09:11,444 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:11,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 546093262, now seen corresponding path program 10 times [2025-04-29 11:09:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:11,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719093190] [2025-04-29 11:09:11,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:09:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:11,452 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:11,456 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 108 of 128 statements. [2025-04-29 11:09:11,456 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:09:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:11,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:11,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719093190] [2025-04-29 11:09:11,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719093190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24855573] [2025-04-29 11:09:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:11,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:12,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:12,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 760 transitions, 13652 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:12,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:12,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:14,985 INFO L116 PetriNetUnfolderBase]: 2710/9351 cut-off events. [2025-04-29 11:09:14,985 INFO L117 PetriNetUnfolderBase]: For 135146/135709 co-relation queries the response was YES. [2025-04-29 11:09:15,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54292 conditions, 9351 events. 2710/9351 cut-off events. For 135146/135709 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 103161 event pairs, 414 based on Foata normal form. 295/9525 useless extension candidates. Maximal degree in co-relation 53984. Up to 2109 conditions per place. [2025-04-29 11:09:15,092 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 590 selfloop transitions, 277 changer transitions 66/1066 dead transitions. [2025-04-29 11:09:15,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1066 transitions, 19373 flow [2025-04-29 11:09:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:09:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:09:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1259 transitions. [2025-04-29 11:09:15,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8070512820512821 [2025-04-29 11:09:15,094 INFO L175 Difference]: Start difference. First operand has 360 places, 760 transitions, 13652 flow. Second operand 13 states and 1259 transitions. [2025-04-29 11:09:15,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1066 transitions, 19373 flow [2025-04-29 11:09:15,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 1066 transitions, 19064 flow, removed 22 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:15,850 INFO L231 Difference]: Finished difference. Result has 376 places, 785 transitions, 14791 flow [2025-04-29 11:09:15,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=13366, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14791, PETRI_PLACES=376, PETRI_TRANSITIONS=785} [2025-04-29 11:09:15,850 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 256 predicate places. [2025-04-29 11:09:15,850 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 785 transitions, 14791 flow [2025-04-29 11:09:15,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:15,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:15,851 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:15,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:15,851 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:15,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1529718408, now seen corresponding path program 11 times [2025-04-29 11:09:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:15,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817462143] [2025-04-29 11:09:15,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:15,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:15,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:15,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:15,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:16,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817462143] [2025-04-29 11:09:16,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817462143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:16,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:16,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336447492] [2025-04-29 11:09:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:16,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:16,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:16,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:16,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:16,561 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 785 transitions, 14791 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:18,623 INFO L116 PetriNetUnfolderBase]: 2684/9208 cut-off events. [2025-04-29 11:09:18,623 INFO L117 PetriNetUnfolderBase]: For 150970/151542 co-relation queries the response was YES. [2025-04-29 11:09:18,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56216 conditions, 9208 events. 2684/9208 cut-off events. For 150970/151542 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 100928 event pairs, 480 based on Foata normal form. 248/9326 useless extension candidates. Maximal degree in co-relation 55898. Up to 2190 conditions per place. [2025-04-29 11:09:18,720 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 541 selfloop transitions, 257 changer transitions 38/969 dead transitions. [2025-04-29 11:09:18,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 969 transitions, 18767 flow [2025-04-29 11:09:18,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:09:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:09:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1070 transitions. [2025-04-29 11:09:18,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2025-04-29 11:09:18,721 INFO L175 Difference]: Start difference. First operand has 376 places, 785 transitions, 14791 flow. Second operand 11 states and 1070 transitions. [2025-04-29 11:09:18,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 969 transitions, 18767 flow [2025-04-29 11:09:19,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 969 transitions, 18597 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-04-29 11:09:19,493 INFO L231 Difference]: Finished difference. Result has 382 places, 789 transitions, 15286 flow [2025-04-29 11:09:19,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=14631, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=785, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15286, PETRI_PLACES=382, PETRI_TRANSITIONS=789} [2025-04-29 11:09:19,493 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 262 predicate places. [2025-04-29 11:09:19,493 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 789 transitions, 15286 flow [2025-04-29 11:09:19,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:19,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:19,494 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:19,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:09:19,494 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:19,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 260007836, now seen corresponding path program 12 times [2025-04-29 11:09:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:19,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116723389] [2025-04-29 11:09:19,495 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:19,502 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 128 statements into 11 equivalence classes. [2025-04-29 11:09:19,505 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:19,505 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:09:19,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:19,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116723389] [2025-04-29 11:09:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116723389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94191676] [2025-04-29 11:09:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:19,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:20,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:20,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 789 transitions, 15286 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:20,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:20,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:20,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:22,517 INFO L116 PetriNetUnfolderBase]: 2667/9168 cut-off events. [2025-04-29 11:09:22,518 INFO L117 PetriNetUnfolderBase]: For 159751/160318 co-relation queries the response was YES. [2025-04-29 11:09:22,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56546 conditions, 9168 events. 2667/9168 cut-off events. For 159751/160318 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 100528 event pairs, 433 based on Foata normal form. 277/9320 useless extension candidates. Maximal degree in co-relation 56228. Up to 2197 conditions per place. [2025-04-29 11:09:22,613 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 505 selfloop transitions, 301 changer transitions 30/969 dead transitions. [2025-04-29 11:09:22,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 969 transitions, 19126 flow [2025-04-29 11:09:22,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:09:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:09:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1152 transitions. [2025-04-29 11:09:22,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-04-29 11:09:22,614 INFO L175 Difference]: Start difference. First operand has 382 places, 789 transitions, 15286 flow. Second operand 12 states and 1152 transitions. [2025-04-29 11:09:22,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 969 transitions, 19126 flow [2025-04-29 11:09:23,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 969 transitions, 18766 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:23,419 INFO L231 Difference]: Finished difference. Result has 391 places, 788 transitions, 15517 flow [2025-04-29 11:09:23,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=14928, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15517, PETRI_PLACES=391, PETRI_TRANSITIONS=788} [2025-04-29 11:09:23,420 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 271 predicate places. [2025-04-29 11:09:23,420 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 788 transitions, 15517 flow [2025-04-29 11:09:23,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:23,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:23,420 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:23,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:09:23,420 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:23,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1977699024, now seen corresponding path program 13 times [2025-04-29 11:09:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:23,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860670514] [2025-04-29 11:09:23,421 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:23,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:09:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:09:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:23,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860670514] [2025-04-29 11:09:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860670514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783524353] [2025-04-29 11:09:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:23,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:23,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:23,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:24,260 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 120 [2025-04-29 11:09:24,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 788 transitions, 15517 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:24,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:24,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 120 [2025-04-29 11:09:24,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:26,349 INFO L116 PetriNetUnfolderBase]: 2661/9171 cut-off events. [2025-04-29 11:09:26,349 INFO L117 PetriNetUnfolderBase]: For 169665/170229 co-relation queries the response was YES. [2025-04-29 11:09:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56995 conditions, 9171 events. 2661/9171 cut-off events. For 169665/170229 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 100533 event pairs, 457 based on Foata normal form. 243/9287 useless extension candidates. Maximal degree in co-relation 56674. Up to 2192 conditions per place. [2025-04-29 11:09:26,444 INFO L140 encePairwiseOnDemand]: 101/120 looper letters, 538 selfloop transitions, 258 changer transitions 37/966 dead transitions. [2025-04-29 11:09:26,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 966 transitions, 19361 flow [2025-04-29 11:09:26,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:09:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:09:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1166 transitions. [2025-04-29 11:09:26,446 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-04-29 11:09:26,446 INFO L175 Difference]: Start difference. First operand has 391 places, 788 transitions, 15517 flow. Second operand 12 states and 1166 transitions. [2025-04-29 11:09:26,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 966 transitions, 19361 flow [2025-04-29 11:09:27,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 966 transitions, 19031 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:27,233 INFO L231 Difference]: Finished difference. Result has 398 places, 785 transitions, 15679 flow [2025-04-29 11:09:27,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=15192, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15679, PETRI_PLACES=398, PETRI_TRANSITIONS=785} [2025-04-29 11:09:27,234 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 278 predicate places. [2025-04-29 11:09:27,234 INFO L485 AbstractCegarLoop]: Abstraction has has 398 places, 785 transitions, 15679 flow [2025-04-29 11:09:27,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:27,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:27,235 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:27,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:09:27,235 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:27,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash -463479658, now seen corresponding path program 14 times [2025-04-29 11:09:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:27,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882528920] [2025-04-29 11:09:27,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:27,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-04-29 11:09:27,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 78 of 128 statements. [2025-04-29 11:09:27,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:27,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15