./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:36:11,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:36:11,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:36:11,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:36:11,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:36:11,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:36:11,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:36:11,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:36:11,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:36:11,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:36:11,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:36:11,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:36:11,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:36:11,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:36:11,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:36:11,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:36:11,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:36:11,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:36:11,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:36:11,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:36:11,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:36:11,499 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-jdk21/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 -> 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d [2025-02-06 09:36:11,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:36:11,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:36:11,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:36:11,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:36:11,735 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:36:11,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2025-02-06 09:36:12,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983e768e7/82beffdf09634e0cba9cd94fef917d9d/FLAG8922ded70 [2025-02-06 09:36:13,111 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:36:13,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2025-02-06 09:36:13,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983e768e7/82beffdf09634e0cba9cd94fef917d9d/FLAG8922ded70 [2025-02-06 09:36:13,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/983e768e7/82beffdf09634e0cba9cd94fef917d9d [2025-02-06 09:36:13,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:36:13,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:36:13,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:36:13,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:36:13,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:36:13,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132efbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13, skipping insertion in model container [2025-02-06 09:36:13,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:36:13,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:36:13,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:36:13,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:36:13,449 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:36:13,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13 WrapperNode [2025-02-06 09:36:13,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:36:13,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:36:13,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:36:13,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:36:13,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,475 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2025-02-06 09:36:13,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:36:13,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:36:13,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:36:13,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:36:13,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:36:13,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:36:13,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:36:13,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:36:13,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (1/1) ... [2025-02-06 09:36:13,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:36:13,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:13,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:36:13,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:36:13,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:36:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:36:13,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:36:13,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:36:13,561 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:36:13,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:36:13,659 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:36:13,776 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-02-06 09:36:13,777 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2025-02-06 09:36:13,797 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:36:13,798 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:36:13,810 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:36:13,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:36:13,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:36:13 BoogieIcfgContainer [2025-02-06 09:36:13,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:36:13,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:36:13,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:36:13,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:36:13,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:36:13" (1/3) ... [2025-02-06 09:36:13,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5733d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:36:13, skipping insertion in model container [2025-02-06 09:36:13,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:36:13" (2/3) ... [2025-02-06 09:36:13,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5733d601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:36:13, skipping insertion in model container [2025-02-06 09:36:13,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:36:13" (3/3) ... [2025-02-06 09:36:13,819 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2025-02-06 09:36:13,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:36:13,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-2.i that has 2 procedures, 74 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 09:36:13,834 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:36:13,868 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:36:13,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 157 flow [2025-02-06 09:36:13,936 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2025-02-06 09:36:13,937 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:36:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 1/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 221 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 2. Up to 3 conditions per place. [2025-02-06 09:36:13,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 75 transitions, 157 flow [2025-02-06 09:36:13,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 75 transitions, 157 flow [2025-02-06 09:36:13,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:36:13,962 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d10aa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:36:13,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 09:36:13,971 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:36:13,971 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:36:13,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:36:13,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:13,972 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] [2025-02-06 09:36:13,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash -849884664, now seen corresponding path program 1 times [2025-02-06 09:36:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671984878] [2025-02-06 09:36:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:14,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:36:14,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:36:14,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:14,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671984878] [2025-02-06 09:36:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671984878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005995159] [2025-02-06 09:36:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:14,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:14,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:14,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-02-06 09:36:14,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-06 09:36:14,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:14,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-02-06 09:36:14,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:14,386 INFO L124 PetriNetUnfolderBase]: 8/185 cut-off events. [2025-02-06 09:36:14,390 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:36:14,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 185 events. 8/185 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs, 0 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-02-06 09:36:14,392 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 10 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2025-02-06 09:36:14,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 195 flow [2025-02-06 09:36:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-02-06 09:36:14,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-02-06 09:36:14,401 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 157 flow. Second operand 4 states and 272 transitions. [2025-02-06 09:36:14,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 195 flow [2025-02-06 09:36:14,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:36:14,405 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 169 flow [2025-02-06 09:36:14,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-02-06 09:36:14,409 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-02-06 09:36:14,409 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 169 flow [2025-02-06 09:36:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-06 09:36:14,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:14,409 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] [2025-02-06 09:36:14,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:36:14,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:14,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2025401462, now seen corresponding path program 1 times [2025-02-06 09:36:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:14,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135666555] [2025-02-06 09:36:14,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:14,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:36:14,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:36:14,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:14,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135666555] [2025-02-06 09:36:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135666555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350652806] [2025-02-06 09:36:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:14,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:14,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:14,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 75 [2025-02-06 09:36:14,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-02-06 09:36:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 75 [2025-02-06 09:36:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:15,048 INFO L124 PetriNetUnfolderBase]: 30/233 cut-off events. [2025-02-06 09:36:15,049 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 09:36:15,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 233 events. 30/233 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 945 event pairs, 4 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 273. Up to 62 conditions per place. [2025-02-06 09:36:15,050 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 25 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-02-06 09:36:15,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 243 flow [2025-02-06 09:36:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-02-06 09:36:15,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7622222222222222 [2025-02-06 09:36:15,052 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 169 flow. Second operand 6 states and 343 transitions. [2025-02-06 09:36:15,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 243 flow [2025-02-06 09:36:15,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 235 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:15,054 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 169 flow [2025-02-06 09:36:15,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-02-06 09:36:15,054 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 5 predicate places. [2025-02-06 09:36:15,055 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 169 flow [2025-02-06 09:36:15,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 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-02-06 09:36:15,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,055 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] [2025-02-06 09:36:15,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:36:15,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1492450601, now seen corresponding path program 1 times [2025-02-06 09:36:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310135878] [2025-02-06 09:36:15,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:36:15,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:36:15,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310135878] [2025-02-06 09:36:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310135878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510925809] [2025-02-06 09:36:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:15,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:15,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 75 [2025-02-06 09:36:15,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-02-06 09:36:15,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 75 [2025-02-06 09:36:15,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:15,128 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-02-06 09:36:15,128 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-02-06 09:36:15,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 141 events. 6/141 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 383 event pairs, 4 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 134. Up to 21 conditions per place. [2025-02-06 09:36:15,129 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-02-06 09:36:15,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 77 transitions, 201 flow [2025-02-06 09:36:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-02-06 09:36:15,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288888888888889 [2025-02-06 09:36:15,130 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 169 flow. Second operand 3 states and 209 transitions. [2025-02-06 09:36:15,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 77 transitions, 201 flow [2025-02-06 09:36:15,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 191 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:15,131 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 189 flow [2025-02-06 09:36:15,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2025-02-06 09:36:15,132 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-02-06 09:36:15,132 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 189 flow [2025-02-06 09:36:15,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-02-06 09:36:15,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,133 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] [2025-02-06 09:36:15,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:36:15,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:15,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1436862769, now seen corresponding path program 1 times [2025-02-06 09:36:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969909359] [2025-02-06 09:36:15,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:36:15,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:36:15,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969909359] [2025-02-06 09:36:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969909359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353219133] [2025-02-06 09:36:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:15,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:15,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 75 [2025-02-06 09:36:15,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-02-06 09:36:15,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 75 [2025-02-06 09:36:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:15,253 INFO L124 PetriNetUnfolderBase]: 2/106 cut-off events. [2025-02-06 09:36:15,253 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:36:15,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 106 events. 2/106 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 0 based on Foata normal form. 3/104 useless extension candidates. Maximal degree in co-relation 82. Up to 7 conditions per place. [2025-02-06 09:36:15,254 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 9 selfloop transitions, 3 changer transitions 7/75 dead transitions. [2025-02-06 09:36:15,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 199 flow [2025-02-06 09:36:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-02-06 09:36:15,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-02-06 09:36:15,255 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 189 flow. Second operand 4 states and 270 transitions. [2025-02-06 09:36:15,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 199 flow [2025-02-06 09:36:15,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 187 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 09:36:15,256 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 153 flow [2025-02-06 09:36:15,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-02-06 09:36:15,257 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-06 09:36:15,257 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 153 flow [2025-02-06 09:36:15,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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-02-06 09:36:15,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,257 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] [2025-02-06 09:36:15,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:36:15,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:15,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1607733821, now seen corresponding path program 1 times [2025-02-06 09:36:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259240008] [2025-02-06 09:36:15,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:36:15,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:36:15,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259240008] [2025-02-06 09:36:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259240008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:36:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355984405] [2025-02-06 09:36:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:15,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:15,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 75 [2025-02-06 09:36:15,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-02-06 09:36:15,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 75 [2025-02-06 09:36:15,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:15,458 INFO L124 PetriNetUnfolderBase]: 6/87 cut-off events. [2025-02-06 09:36:15,458 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:36:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 87 events. 6/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 0 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 114. Up to 5 conditions per place. [2025-02-06 09:36:15,459 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-02-06 09:36:15,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-02-06 09:36:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:36:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 09:36:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 450 transitions. [2025-02-06 09:36:15,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-02-06 09:36:15,461 INFO L175 Difference]: Start difference. First operand has 80 places, 66 transitions, 153 flow. Second operand 7 states and 450 transitions. [2025-02-06 09:36:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-02-06 09:36:15,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:15,462 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-02-06 09:36:15,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-02-06 09:36:15,462 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -18 predicate places. [2025-02-06 09:36:15,462 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-02-06 09:36:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 0 states have call successors, (0), 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-02-06 09:36:15,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:15,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:36:15,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-02-06 09:36:15,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash 744727939, now seen corresponding path program 1 times [2025-02-06 09:36:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049101828] [2025-02-06 09:36:15,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:36:15,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:36:15,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:15,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:36:15,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:36:15,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:36:15,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:15,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:36:15,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:36:15,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 09:36:15,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-02-06 09:36:15,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-02-06 09:36:15,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-02-06 09:36:15,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-02-06 09:36:15,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-02-06 09:36:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:36:15,508 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:36:15,510 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:36:15,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:36:15,525 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:36:15,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 93 transitions, 202 flow [2025-02-06 09:36:15,553 INFO L124 PetriNetUnfolderBase]: 3/190 cut-off events. [2025-02-06 09:36:15,557 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:36:15,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 190 events. 3/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 455 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2025-02-06 09:36:15,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 93 transitions, 202 flow [2025-02-06 09:36:15,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 202 flow [2025-02-06 09:36:15,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:36:15,559 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d10aa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:36:15,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 09:36:15,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:36:15,561 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:36:15,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:36:15,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,561 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] [2025-02-06 09:36:15,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash 861401576, now seen corresponding path program 1 times [2025-02-06 09:36:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225662205] [2025-02-06 09:36:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:36:15,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:36:15,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225662205] [2025-02-06 09:36:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225662205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:15,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475056079] [2025-02-06 09:36:15,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:15,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:15,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-02-06 09:36:15,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-02-06 09:36:15,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-02-06 09:36:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:15,711 INFO L124 PetriNetUnfolderBase]: 72/571 cut-off events. [2025-02-06 09:36:15,711 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 09:36:15,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 571 events. 72/571 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3298 event pairs, 35 based on Foata normal form. 1/523 useless extension candidates. Maximal degree in co-relation 336. Up to 106 conditions per place. [2025-02-06 09:36:15,714 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 18 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-02-06 09:36:15,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 260 flow [2025-02-06 09:36:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2025-02-06 09:36:15,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2025-02-06 09:36:15,716 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 202 flow. Second operand 4 states and 335 transitions. [2025-02-06 09:36:15,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 260 flow [2025-02-06 09:36:15,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:36:15,718 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 218 flow [2025-02-06 09:36:15,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-02-06 09:36:15,719 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2025-02-06 09:36:15,719 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 218 flow [2025-02-06 09:36:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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-02-06 09:36:15,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:15,720 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] [2025-02-06 09:36:15,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:36:15,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:15,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1692066131, now seen corresponding path program 1 times [2025-02-06 09:36:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44144118] [2025-02-06 09:36:15,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:15,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:36:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:36:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44144118] [2025-02-06 09:36:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44144118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889901660] [2025-02-06 09:36:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:15,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:15,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:15,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 93 [2025-02-06 09:36:15,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-02-06 09:36:15,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:15,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 93 [2025-02-06 09:36:15,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:16,085 INFO L124 PetriNetUnfolderBase]: 236/941 cut-off events. [2025-02-06 09:36:16,085 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 09:36:16,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 941 events. 236/941 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6563 event pairs, 91 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 443. Up to 313 conditions per place. [2025-02-06 09:36:16,089 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 38 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-02-06 09:36:16,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 334 flow [2025-02-06 09:36:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-02-06 09:36:16,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7867383512544803 [2025-02-06 09:36:16,091 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 218 flow. Second operand 6 states and 439 transitions. [2025-02-06 09:36:16,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 334 flow [2025-02-06 09:36:16,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:16,093 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 220 flow [2025-02-06 09:36:16,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-02-06 09:36:16,094 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 6 predicate places. [2025-02-06 09:36:16,094 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 220 flow [2025-02-06 09:36:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 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-02-06 09:36:16,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:16,094 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] [2025-02-06 09:36:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:36:16,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash 528694742, now seen corresponding path program 1 times [2025-02-06 09:36:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836471040] [2025-02-06 09:36:16,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:16,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:36:16,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:36:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836471040] [2025-02-06 09:36:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836471040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445484958] [2025-02-06 09:36:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:16,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:16,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:16,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-02-06 09:36:16,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-02-06 09:36:16,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:16,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-02-06 09:36:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:16,209 INFO L124 PetriNetUnfolderBase]: 116/707 cut-off events. [2025-02-06 09:36:16,209 INFO L125 PetriNetUnfolderBase]: For 120/165 co-relation queries the response was YES. [2025-02-06 09:36:16,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 707 events. 116/707 cut-off events. For 120/165 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4615 event pairs, 58 based on Foata normal form. 4/621 useless extension candidates. Maximal degree in co-relation 463. Up to 185 conditions per place. [2025-02-06 09:36:16,213 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-02-06 09:36:16,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 290 flow [2025-02-06 09:36:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-02-06 09:36:16,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247311827956989 [2025-02-06 09:36:16,215 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 220 flow. Second operand 3 states and 258 transitions. [2025-02-06 09:36:16,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 290 flow [2025-02-06 09:36:16,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 280 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:16,217 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 248 flow [2025-02-06 09:36:16,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2025-02-06 09:36:16,217 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-02-06 09:36:16,217 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 248 flow [2025-02-06 09:36:16,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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-02-06 09:36:16,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:16,218 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] [2025-02-06 09:36:16,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:36:16,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:16,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1262183778, now seen corresponding path program 1 times [2025-02-06 09:36:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378034492] [2025-02-06 09:36:16,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:16,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:16,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:36:16,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:36:16,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:16,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:16,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:16,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378034492] [2025-02-06 09:36:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378034492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:16,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:16,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414904355] [2025-02-06 09:36:16,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:16,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:16,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:16,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:16,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-02-06 09:36:16,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-02-06 09:36:16,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:16,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-02-06 09:36:16,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:16,369 INFO L124 PetriNetUnfolderBase]: 63/580 cut-off events. [2025-02-06 09:36:16,369 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 09:36:16,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 580 events. 63/580 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3209 event pairs, 24 based on Foata normal form. 15/544 useless extension candidates. Maximal degree in co-relation 632. Up to 72 conditions per place. [2025-02-06 09:36:16,372 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 19 selfloop transitions, 4 changer transitions 3/108 dead transitions. [2025-02-06 09:36:16,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 108 transitions, 328 flow [2025-02-06 09:36:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2025-02-06 09:36:16,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2025-02-06 09:36:16,373 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 248 flow. Second operand 4 states and 339 transitions. [2025-02-06 09:36:16,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 108 transitions, 328 flow [2025-02-06 09:36:16,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 108 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:16,375 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 254 flow [2025-02-06 09:36:16,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-02-06 09:36:16,376 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 7 predicate places. [2025-02-06 09:36:16,376 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 254 flow [2025-02-06 09:36:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 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-02-06 09:36:16,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:16,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:16,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:36:16,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash 394892909, now seen corresponding path program 1 times [2025-02-06 09:36:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:16,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237328474] [2025-02-06 09:36:16,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:16,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:36:16,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:36:16,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:16,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237328474] [2025-02-06 09:36:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237328474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:36:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793599356] [2025-02-06 09:36:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:16,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:16,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-02-06 09:36:16,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-02-06 09:36:16,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:16,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-02-06 09:36:16,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:16,659 INFO L124 PetriNetUnfolderBase]: 111/852 cut-off events. [2025-02-06 09:36:16,659 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-02-06 09:36:16,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 852 events. 111/852 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5389 event pairs, 21 based on Foata normal form. 3/781 useless extension candidates. Maximal degree in co-relation 742. Up to 125 conditions per place. [2025-02-06 09:36:16,662 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 24 selfloop transitions, 7 changer transitions 3/114 dead transitions. [2025-02-06 09:36:16,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 354 flow [2025-02-06 09:36:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:36:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 09:36:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2025-02-06 09:36:16,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2025-02-06 09:36:16,663 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 254 flow. Second operand 7 states and 567 transitions. [2025-02-06 09:36:16,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 354 flow [2025-02-06 09:36:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:16,665 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 278 flow [2025-02-06 09:36:16,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2025-02-06 09:36:16,666 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 14 predicate places. [2025-02-06 09:36:16,666 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 278 flow [2025-02-06 09:36:16,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 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-02-06 09:36:16,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:16,667 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:16,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:36:16,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1898818033, now seen corresponding path program 1 times [2025-02-06 09:36:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167500816] [2025-02-06 09:36:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:16,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:36:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:36:16,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:16,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167500816] [2025-02-06 09:36:16,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167500816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:16,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:16,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073689058] [2025-02-06 09:36:16,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:16,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:16,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:16,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 93 [2025-02-06 09:36:16,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-02-06 09:36:16,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:16,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 93 [2025-02-06 09:36:16,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:16,756 INFO L124 PetriNetUnfolderBase]: 58/570 cut-off events. [2025-02-06 09:36:16,756 INFO L125 PetriNetUnfolderBase]: For 156/208 co-relation queries the response was YES. [2025-02-06 09:36:16,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 570 events. 58/570 cut-off events. For 156/208 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3280 event pairs, 32 based on Foata normal form. 3/527 useless extension candidates. Maximal degree in co-relation 758. Up to 111 conditions per place. [2025-02-06 09:36:16,758 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 18 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-02-06 09:36:16,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 347 flow [2025-02-06 09:36:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-02-06 09:36:16,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921146953405018 [2025-02-06 09:36:16,759 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 278 flow. Second operand 3 states and 257 transitions. [2025-02-06 09:36:16,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 347 flow [2025-02-06 09:36:16,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 337 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:16,761 INFO L231 Difference]: Finished difference. Result has 111 places, 104 transitions, 314 flow [2025-02-06 09:36:16,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2025-02-06 09:36:16,762 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-02-06 09:36:16,762 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 314 flow [2025-02-06 09:36:16,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-02-06 09:36:16,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:16,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:16,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:36:16,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:16,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1366992420, now seen corresponding path program 1 times [2025-02-06 09:36:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:16,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518640795] [2025-02-06 09:36:16,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:16,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:36:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:36:16,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:16,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:16,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518640795] [2025-02-06 09:36:16,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518640795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:16,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:16,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:36:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294052464] [2025-02-06 09:36:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:16,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:36:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:16,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:36:16,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:36:16,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 93 [2025-02-06 09:36:16,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 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-02-06 09:36:16,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:16,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 93 [2025-02-06 09:36:16,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:17,018 INFO L124 PetriNetUnfolderBase]: 71/470 cut-off events. [2025-02-06 09:36:17,019 INFO L125 PetriNetUnfolderBase]: For 93/97 co-relation queries the response was YES. [2025-02-06 09:36:17,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 470 events. 71/470 cut-off events. For 93/97 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2513 event pairs, 1 based on Foata normal form. 14/473 useless extension candidates. Maximal degree in co-relation 741. Up to 32 conditions per place. [2025-02-06 09:36:17,020 INFO L140 encePairwiseOnDemand]: 87/93 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-02-06 09:36:17,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-02-06 09:36:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:36:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:36:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2025-02-06 09:36:17,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853763440860215 [2025-02-06 09:36:17,022 INFO L175 Difference]: Start difference. First operand has 111 places, 104 transitions, 314 flow. Second operand 10 states and 794 transitions. [2025-02-06 09:36:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-02-06 09:36:17,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:36:17,024 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-02-06 09:36:17,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-02-06 09:36:17,025 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2025-02-06 09:36:17,025 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-02-06 09:36:17,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 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-02-06 09:36:17,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:17,025 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:36:17,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-02-06 09:36:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1871679209, now seen corresponding path program 1 times [2025-02-06 09:36:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632425086] [2025-02-06 09:36:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:17,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:36:17,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:36:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:17,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:36:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:36:17,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:36:17,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:17,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:17,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:36:17,051 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:36:17,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-02-06 09:36:17,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-02-06 09:36:17,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-02-06 09:36:17,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-02-06 09:36:17,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-02-06 09:36:17,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-02-06 09:36:17,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-02-06 09:36:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:36:17,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:17,052 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:36:17,052 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:36:17,063 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:36:17,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 249 flow [2025-02-06 09:36:17,081 INFO L124 PetriNetUnfolderBase]: 8/319 cut-off events. [2025-02-06 09:36:17,081 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:36:17,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 319 events. 8/319 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 925 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 198. Up to 12 conditions per place. [2025-02-06 09:36:17,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 249 flow [2025-02-06 09:36:17,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 249 flow [2025-02-06 09:36:17,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:36:17,083 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d10aa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:36:17,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 09:36:17,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:36:17,085 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:36:17,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:36:17,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:17,085 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] [2025-02-06 09:36:17,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:17,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash -975420792, now seen corresponding path program 1 times [2025-02-06 09:36:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:17,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552805203] [2025-02-06 09:36:17,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:36:17,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:36:17,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:17,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:17,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:17,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552805203] [2025-02-06 09:36:17,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552805203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:17,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123908053] [2025-02-06 09:36:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:17,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:17,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:17,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-02-06 09:36:17,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-02-06 09:36:17,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:17,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-02-06 09:36:17,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:17,306 INFO L124 PetriNetUnfolderBase]: 413/2179 cut-off events. [2025-02-06 09:36:17,306 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-02-06 09:36:17,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2179 events. 413/2179 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17461 event pairs, 232 based on Foata normal form. 1/1993 useless extension candidates. Maximal degree in co-relation 1327. Up to 496 conditions per place. [2025-02-06 09:36:17,316 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 24 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-02-06 09:36:17,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 323 flow [2025-02-06 09:36:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-02-06 09:36:17,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8941441441441441 [2025-02-06 09:36:17,317 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 249 flow. Second operand 4 states and 397 transitions. [2025-02-06 09:36:17,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 323 flow [2025-02-06 09:36:17,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:36:17,319 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 265 flow [2025-02-06 09:36:17,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-02-06 09:36:17,320 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2025-02-06 09:36:17,320 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 265 flow [2025-02-06 09:36:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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-02-06 09:36:17,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:17,320 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] [2025-02-06 09:36:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:36:17,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:17,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1199637694, now seen corresponding path program 1 times [2025-02-06 09:36:17,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:17,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418949851] [2025-02-06 09:36:17,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:17,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:36:17,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:36:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:17,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418949851] [2025-02-06 09:36:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418949851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651816289] [2025-02-06 09:36:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:17,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:17,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:17,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 111 [2025-02-06 09:36:17,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-02-06 09:36:17,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:17,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 111 [2025-02-06 09:36:17,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:17,860 INFO L124 PetriNetUnfolderBase]: 1292/3939 cut-off events. [2025-02-06 09:36:17,861 INFO L125 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-02-06 09:36:17,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 3939 events. 1292/3939 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 34550 event pairs, 412 based on Foata normal form. 0/3678 useless extension candidates. Maximal degree in co-relation 5573. Up to 1483 conditions per place. [2025-02-06 09:36:17,879 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-02-06 09:36:17,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 421 flow [2025-02-06 09:36:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2025-02-06 09:36:17,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8033033033033034 [2025-02-06 09:36:17,881 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 265 flow. Second operand 6 states and 535 transitions. [2025-02-06 09:36:17,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 421 flow [2025-02-06 09:36:17,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:17,884 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 267 flow [2025-02-06 09:36:17,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2025-02-06 09:36:17,884 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2025-02-06 09:36:17,884 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 267 flow [2025-02-06 09:36:17,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 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-02-06 09:36:17,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:17,885 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] [2025-02-06 09:36:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:36:17,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:17,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash 525504629, now seen corresponding path program 1 times [2025-02-06 09:36:17,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:17,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402716484] [2025-02-06 09:36:17,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:17,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:36:17,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:36:17,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:17,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:17,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402716484] [2025-02-06 09:36:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402716484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:17,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:17,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:17,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609128725] [2025-02-06 09:36:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:17,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:17,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:17,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:17,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-02-06 09:36:17,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-02-06 09:36:17,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:17,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-02-06 09:36:17,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:18,278 INFO L124 PetriNetUnfolderBase]: 1023/4159 cut-off events. [2025-02-06 09:36:18,278 INFO L125 PetriNetUnfolderBase]: For 676/930 co-relation queries the response was YES. [2025-02-06 09:36:18,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6131 conditions, 4159 events. 1023/4159 cut-off events. For 676/930 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 39657 event pairs, 581 based on Foata normal form. 4/3617 useless extension candidates. Maximal degree in co-relation 2112. Up to 1329 conditions per place. [2025-02-06 09:36:18,304 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 27 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2025-02-06 09:36:18,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 377 flow [2025-02-06 09:36:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-02-06 09:36:18,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-02-06 09:36:18,305 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 267 flow. Second operand 3 states and 307 transitions. [2025-02-06 09:36:18,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 377 flow [2025-02-06 09:36:18,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 367 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:18,307 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 303 flow [2025-02-06 09:36:18,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-02-06 09:36:18,308 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-02-06 09:36:18,308 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 303 flow [2025-02-06 09:36:18,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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-02-06 09:36:18,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:18,308 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] [2025-02-06 09:36:18,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:36:18,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:18,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2069678429, now seen corresponding path program 1 times [2025-02-06 09:36:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:18,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833669003] [2025-02-06 09:36:18,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:18,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:36:18,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:36:18,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:18,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:18,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:18,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833669003] [2025-02-06 09:36:18,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833669003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:18,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:18,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696669502] [2025-02-06 09:36:18,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:18,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:18,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:18,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:18,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:18,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2025-02-06 09:36:18,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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-02-06 09:36:18,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:18,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2025-02-06 09:36:18,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:18,599 INFO L124 PetriNetUnfolderBase]: 662/3141 cut-off events. [2025-02-06 09:36:18,599 INFO L125 PetriNetUnfolderBase]: For 430/450 co-relation queries the response was YES. [2025-02-06 09:36:18,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 3141 events. 662/3141 cut-off events. For 430/450 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28350 event pairs, 320 based on Foata normal form. 63/2852 useless extension candidates. Maximal degree in co-relation 3788. Up to 540 conditions per place. [2025-02-06 09:36:18,610 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 31 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-02-06 09:36:18,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 414 flow [2025-02-06 09:36:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 404 transitions. [2025-02-06 09:36:18,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-02-06 09:36:18,612 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 303 flow. Second operand 4 states and 404 transitions. [2025-02-06 09:36:18,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 414 flow [2025-02-06 09:36:18,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:18,614 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 307 flow [2025-02-06 09:36:18,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-02-06 09:36:18,614 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 7 predicate places. [2025-02-06 09:36:18,614 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 307 flow [2025-02-06 09:36:18,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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-02-06 09:36:18,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:18,615 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] [2025-02-06 09:36:18,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:36:18,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:18,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1087165987, now seen corresponding path program 1 times [2025-02-06 09:36:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394048276] [2025-02-06 09:36:18,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:18,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:36:18,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:36:18,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:18,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:36:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394048276] [2025-02-06 09:36:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394048276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:36:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179639289] [2025-02-06 09:36:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:18,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:18,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-02-06 09:36:18,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-02-06 09:36:18,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:18,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-02-06 09:36:18,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:19,087 INFO L124 PetriNetUnfolderBase]: 950/4761 cut-off events. [2025-02-06 09:36:19,087 INFO L125 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-02-06 09:36:19,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6986 conditions, 4761 events. 950/4761 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 47777 event pairs, 310 based on Foata normal form. 3/4187 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-02-06 09:36:19,102 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 35 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2025-02-06 09:36:19,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 137 transitions, 433 flow [2025-02-06 09:36:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:36:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 09:36:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2025-02-06 09:36:19,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661518661518661 [2025-02-06 09:36:19,104 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 307 flow. Second operand 7 states and 673 transitions. [2025-02-06 09:36:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 137 transitions, 433 flow [2025-02-06 09:36:19,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:19,108 INFO L231 Difference]: Finished difference. Result has 129 places, 120 transitions, 337 flow [2025-02-06 09:36:19,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=129, PETRI_TRANSITIONS=120} [2025-02-06 09:36:19,108 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-02-06 09:36:19,108 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 120 transitions, 337 flow [2025-02-06 09:36:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 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-02-06 09:36:19,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:19,109 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:36:19,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 641336527, now seen corresponding path program 1 times [2025-02-06 09:36:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129549362] [2025-02-06 09:36:19,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:19,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:36:19,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:36:19,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:19,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:36:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129549362] [2025-02-06 09:36:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129549362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:19,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:19,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093146102] [2025-02-06 09:36:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:19,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:19,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:19,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-02-06 09:36:19,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 120 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-06 09:36:19,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:19,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-02-06 09:36:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:19,411 INFO L124 PetriNetUnfolderBase]: 938/3984 cut-off events. [2025-02-06 09:36:19,411 INFO L125 PetriNetUnfolderBase]: For 1268/1455 co-relation queries the response was YES. [2025-02-06 09:36:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 3984 events. 938/3984 cut-off events. For 1268/1455 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39532 event pairs, 546 based on Foata normal form. 7/3597 useless extension candidates. Maximal degree in co-relation 6424. Up to 1216 conditions per place. [2025-02-06 09:36:19,469 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 28 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2025-02-06 09:36:19,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 462 flow [2025-02-06 09:36:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2025-02-06 09:36:19,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-02-06 09:36:19,471 INFO L175 Difference]: Start difference. First operand has 129 places, 120 transitions, 337 flow. Second operand 3 states and 306 transitions. [2025-02-06 09:36:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 462 flow [2025-02-06 09:36:19,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 452 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:19,474 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 403 flow [2025-02-06 09:36:19,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-02-06 09:36:19,474 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 15 predicate places. [2025-02-06 09:36:19,474 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 403 flow [2025-02-06 09:36:19,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-06 09:36:19,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:19,475 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:19,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:36:19,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:19,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1859988941, now seen corresponding path program 1 times [2025-02-06 09:36:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468319875] [2025-02-06 09:36:19,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:19,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:36:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:36:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:36:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468319875] [2025-02-06 09:36:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468319875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:36:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16194834] [2025-02-06 09:36:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:19,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:36:19,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:19,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:36:19,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:36:19,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2025-02-06 09:36:19,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-02-06 09:36:19,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:19,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2025-02-06 09:36:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:20,223 INFO L124 PetriNetUnfolderBase]: 1255/6166 cut-off events. [2025-02-06 09:36:20,224 INFO L125 PetriNetUnfolderBase]: For 1548/2574 co-relation queries the response was YES. [2025-02-06 09:36:20,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9875 conditions, 6166 events. 1255/6166 cut-off events. For 1548/2574 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 65376 event pairs, 161 based on Foata normal form. 16/5425 useless extension candidates. Maximal degree in co-relation 5439. Up to 961 conditions per place. [2025-02-06 09:36:20,285 INFO L140 encePairwiseOnDemand]: 104/111 looper letters, 47 selfloop transitions, 10 changer transitions 0/159 dead transitions. [2025-02-06 09:36:20,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 159 transitions, 585 flow [2025-02-06 09:36:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:36:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:36:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 958 transitions. [2025-02-06 09:36:20,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.863063063063063 [2025-02-06 09:36:20,295 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 403 flow. Second operand 10 states and 958 transitions. [2025-02-06 09:36:20,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 159 transitions, 585 flow [2025-02-06 09:36:20,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 159 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:20,301 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 425 flow [2025-02-06 09:36:20,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=425, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-02-06 09:36:20,302 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 25 predicate places. [2025-02-06 09:36:20,302 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 425 flow [2025-02-06 09:36:20,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 0 states have call successors, (0), 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-02-06 09:36:20,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:20,302 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:36:20,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:20,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:20,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1108435485, now seen corresponding path program 1 times [2025-02-06 09:36:20,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565166472] [2025-02-06 09:36:20,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:20,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:36:20,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:36:20,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:20,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:36:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565166472] [2025-02-06 09:36:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565166472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:36:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699997378] [2025-02-06 09:36:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:20,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:20,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 111 [2025-02-06 09:36:20,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-02-06 09:36:20,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:20,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 111 [2025-02-06 09:36:20,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:20,493 INFO L124 PetriNetUnfolderBase]: 91/1220 cut-off events. [2025-02-06 09:36:20,493 INFO L125 PetriNetUnfolderBase]: For 292/352 co-relation queries the response was YES. [2025-02-06 09:36:20,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 1220 events. 91/1220 cut-off events. For 292/352 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8858 event pairs, 48 based on Foata normal form. 20/1135 useless extension candidates. Maximal degree in co-relation 1574. Up to 106 conditions per place. [2025-02-06 09:36:20,499 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-02-06 09:36:20,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 456 flow [2025-02-06 09:36:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-02-06 09:36:20,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2025-02-06 09:36:20,500 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 425 flow. Second operand 3 states and 315 transitions. [2025-02-06 09:36:20,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 456 flow [2025-02-06 09:36:20,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 128 transitions, 430 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:36:20,504 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 375 flow [2025-02-06 09:36:20,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2025-02-06 09:36:20,504 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 21 predicate places. [2025-02-06 09:36:20,504 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 375 flow [2025-02-06 09:36:20,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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-02-06 09:36:20,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:20,505 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:20,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:36:20,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2061578932, now seen corresponding path program 1 times [2025-02-06 09:36:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:20,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957492932] [2025-02-06 09:36:20,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:20,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:36:20,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:36:20,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:20,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 09:36:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957492932] [2025-02-06 09:36:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957492932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344156363] [2025-02-06 09:36:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:20,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:20,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:20,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2025-02-06 09:36:20,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-06 09:36:20,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:20,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2025-02-06 09:36:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:20,692 INFO L124 PetriNetUnfolderBase]: 177/1401 cut-off events. [2025-02-06 09:36:20,693 INFO L125 PetriNetUnfolderBase]: For 701/749 co-relation queries the response was YES. [2025-02-06 09:36:20,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2420 conditions, 1401 events. 177/1401 cut-off events. For 701/749 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10851 event pairs, 135 based on Foata normal form. 3/1290 useless extension candidates. Maximal degree in co-relation 2120. Up to 336 conditions per place. [2025-02-06 09:36:20,700 INFO L140 encePairwiseOnDemand]: 106/111 looper letters, 23 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-02-06 09:36:20,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 449 flow [2025-02-06 09:36:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2025-02-06 09:36:20,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978978978978979 [2025-02-06 09:36:20,701 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 375 flow. Second operand 3 states and 299 transitions. [2025-02-06 09:36:20,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 449 flow [2025-02-06 09:36:20,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:36:20,704 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 403 flow [2025-02-06 09:36:20,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=139, PETRI_TRANSITIONS=126} [2025-02-06 09:36:20,705 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 24 predicate places. [2025-02-06 09:36:20,705 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 403 flow [2025-02-06 09:36:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-06 09:36:20,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:20,706 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:36:20,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:20,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 287571614, now seen corresponding path program 1 times [2025-02-06 09:36:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957841577] [2025-02-06 09:36:20,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:20,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 09:36:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 09:36:20,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 09:36:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957841577] [2025-02-06 09:36:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957841577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:20,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:36:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189992552] [2025-02-06 09:36:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:36:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:20,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:36:20,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:36:20,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 111 [2025-02-06 09:36:20,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 126 transitions, 403 flow. Second operand has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-02-06 09:36:20,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:20,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 111 [2025-02-06 09:36:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:21,128 INFO L124 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-02-06 09:36:21,129 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-02-06 09:36:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4797 event pairs, 4 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-02-06 09:36:21,132 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-02-06 09:36:21,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-02-06 09:36:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:36:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:36:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2025-02-06 09:36:21,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447678447678447 [2025-02-06 09:36:21,135 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 403 flow. Second operand 13 states and 1219 transitions. [2025-02-06 09:36:21,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-02-06 09:36:21,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-02-06 09:36:21,138 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-02-06 09:36:21,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-02-06 09:36:21,139 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-02-06 09:36:21,139 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-02-06 09:36:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 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-02-06 09:36:21,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:21,140 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:21,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:36:21,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-02-06 09:36:21,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1525594578, now seen corresponding path program 1 times [2025-02-06 09:36:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841671283] [2025-02-06 09:36:21,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:21,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 09:36:21,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 09:36:21,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:21,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:36:21,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 09:36:21,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 09:36:21,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:36:21,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:36:21,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-02-06 09:36:21,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-02-06 09:36:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:36:21,183 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:21,183 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:36:21,183 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 09:36:21,202 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:36:21,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 298 flow [2025-02-06 09:36:21,232 INFO L124 PetriNetUnfolderBase]: 21/544 cut-off events. [2025-02-06 09:36:21,232 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 09:36:21,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 544 events. 21/544 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2072 event pairs, 6 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 339. Up to 32 conditions per place. [2025-02-06 09:36:21,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 298 flow [2025-02-06 09:36:21,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 129 transitions, 298 flow [2025-02-06 09:36:21,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:36:21,237 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d10aa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:36:21,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:36:21,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:36:21,239 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-02-06 09:36:21,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:36:21,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:21,239 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] [2025-02-06 09:36:21,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2065384472, now seen corresponding path program 1 times [2025-02-06 09:36:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151790046] [2025-02-06 09:36:21,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:36:21,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:36:21,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151790046] [2025-02-06 09:36:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151790046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:21,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605904609] [2025-02-06 09:36:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:21,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:21,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:21,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:21,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-02-06 09:36:21,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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-02-06 09:36:21,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:21,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-02-06 09:36:21,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:21,845 INFO L124 PetriNetUnfolderBase]: 2017/8193 cut-off events. [2025-02-06 09:36:21,845 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-02-06 09:36:21,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 8193 events. 2017/8193 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 83712 event pairs, 1191 based on Foata normal form. 1/7482 useless extension candidates. Maximal degree in co-relation 5267. Up to 2119 conditions per place. [2025-02-06 09:36:21,900 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-02-06 09:36:21,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 140 transitions, 388 flow [2025-02-06 09:36:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2025-02-06 09:36:21,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2025-02-06 09:36:21,901 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 298 flow. Second operand 4 states and 459 transitions. [2025-02-06 09:36:21,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 140 transitions, 388 flow [2025-02-06 09:36:21,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:36:21,904 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 314 flow [2025-02-06 09:36:21,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2025-02-06 09:36:21,904 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places. [2025-02-06 09:36:21,904 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 314 flow [2025-02-06 09:36:21,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 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-02-06 09:36:21,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:21,905 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] [2025-02-06 09:36:21,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:36:21,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1940224579, now seen corresponding path program 1 times [2025-02-06 09:36:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011952548] [2025-02-06 09:36:21,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:21,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:36:21,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:36:21,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:22,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011952548] [2025-02-06 09:36:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011952548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:22,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535379129] [2025-02-06 09:36:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:22,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:22,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:22,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:22,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-02-06 09:36:22,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-02-06 09:36:22,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:22,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-02-06 09:36:22,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:23,308 INFO L124 PetriNetUnfolderBase]: 6248/15570 cut-off events. [2025-02-06 09:36:23,308 INFO L125 PetriNetUnfolderBase]: For 1593/1593 co-relation queries the response was YES. [2025-02-06 09:36:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25646 conditions, 15570 events. 6248/15570 cut-off events. For 1593/1593 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 157760 event pairs, 808 based on Foata normal form. 0/14524 useless extension candidates. Maximal degree in co-relation 23371. Up to 6781 conditions per place. [2025-02-06 09:36:23,389 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 62 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-02-06 09:36:23,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 161 transitions, 510 flow [2025-02-06 09:36:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-02-06 09:36:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8152454780361758 [2025-02-06 09:36:23,390 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 314 flow. Second operand 6 states and 631 transitions. [2025-02-06 09:36:23,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 161 transitions, 510 flow [2025-02-06 09:36:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:23,401 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 316 flow [2025-02-06 09:36:23,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-02-06 09:36:23,401 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2025-02-06 09:36:23,402 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 316 flow [2025-02-06 09:36:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 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-02-06 09:36:23,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:23,402 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] [2025-02-06 09:36:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:36:23,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2006916278, now seen corresponding path program 1 times [2025-02-06 09:36:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478116683] [2025-02-06 09:36:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:23,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:36:23,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:36:23,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:23,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478116683] [2025-02-06 09:36:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478116683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529154439] [2025-02-06 09:36:23,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:23,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:23,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:23,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:23,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-02-06 09:36:23,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:23,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:23,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:25,352 INFO L124 PetriNetUnfolderBase]: 7160/22223 cut-off events. [2025-02-06 09:36:25,352 INFO L125 PetriNetUnfolderBase]: For 5010/5524 co-relation queries the response was YES. [2025-02-06 09:36:25,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34212 conditions, 22223 events. 7160/22223 cut-off events. For 5010/5524 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 265729 event pairs, 5035 based on Foata normal form. 10/19775 useless extension candidates. Maximal degree in co-relation 27383. Up to 8447 conditions per place. [2025-02-06 09:36:25,508 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 36 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-02-06 09:36:25,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 468 flow [2025-02-06 09:36:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-02-06 09:36:25,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198966408268734 [2025-02-06 09:36:25,509 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 316 flow. Second operand 3 states and 356 transitions. [2025-02-06 09:36:25,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 468 flow [2025-02-06 09:36:25,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:36:25,515 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 360 flow [2025-02-06 09:36:25,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2025-02-06 09:36:25,515 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 5 predicate places. [2025-02-06 09:36:25,515 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 360 flow [2025-02-06 09:36:25,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-02-06 09:36:25,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:25,516 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] [2025-02-06 09:36:25,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:36:25,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1452452498, now seen corresponding path program 1 times [2025-02-06 09:36:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017130238] [2025-02-06 09:36:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:36:25,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:36:25,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:25,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:25,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017130238] [2025-02-06 09:36:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017130238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:25,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:36:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274876835] [2025-02-06 09:36:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:25,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:36:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:25,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:36:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:36:25,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-02-06 09:36:25,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-02-06 09:36:25,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:25,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-02-06 09:36:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:27,103 INFO L124 PetriNetUnfolderBase]: 4968/18140 cut-off events. [2025-02-06 09:36:27,103 INFO L125 PetriNetUnfolderBase]: For 2733/2797 co-relation queries the response was YES. [2025-02-06 09:36:27,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28074 conditions, 18140 events. 4968/18140 cut-off events. For 2733/2797 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 220521 event pairs, 2078 based on Foata normal form. 259/16274 useless extension candidates. Maximal degree in co-relation 22754. Up to 3640 conditions per place. [2025-02-06 09:36:27,222 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 40 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-02-06 09:36:27,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 502 flow [2025-02-06 09:36:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:36:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:36:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2025-02-06 09:36:27,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9089147286821705 [2025-02-06 09:36:27,223 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 360 flow. Second operand 4 states and 469 transitions. [2025-02-06 09:36:27,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 502 flow [2025-02-06 09:36:27,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:27,233 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 362 flow [2025-02-06 09:36:27,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2025-02-06 09:36:27,234 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 7 predicate places. [2025-02-06 09:36:27,234 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 362 flow [2025-02-06 09:36:27,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 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-02-06 09:36:27,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:27,234 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] [2025-02-06 09:36:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:36:27,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1456524429, now seen corresponding path program 1 times [2025-02-06 09:36:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018387807] [2025-02-06 09:36:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:27,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:36:27,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:36:27,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:27,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:27,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018387807] [2025-02-06 09:36:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018387807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:36:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701691691] [2025-02-06 09:36:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:27,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:27,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:27,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:27,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-02-06 09:36:27,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:27,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:27,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:29,520 INFO L124 PetriNetUnfolderBase]: 6364/23537 cut-off events. [2025-02-06 09:36:29,521 INFO L125 PetriNetUnfolderBase]: For 3160/3160 co-relation queries the response was YES. [2025-02-06 09:36:29,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35945 conditions, 23537 events. 6364/23537 cut-off events. For 3160/3160 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 298169 event pairs, 2751 based on Foata normal form. 3/20176 useless extension candidates. Maximal degree in co-relation 20507. Up to 5703 conditions per place. [2025-02-06 09:36:29,868 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 41 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-02-06 09:36:29,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 158 transitions, 504 flow [2025-02-06 09:36:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:36:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 09:36:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2025-02-06 09:36:29,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-02-06 09:36:29,870 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 362 flow. Second operand 7 states and 777 transitions. [2025-02-06 09:36:29,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 158 transitions, 504 flow [2025-02-06 09:36:29,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:29,877 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 392 flow [2025-02-06 09:36:29,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-02-06 09:36:29,878 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 14 predicate places. [2025-02-06 09:36:29,878 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 392 flow [2025-02-06 09:36:29,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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-02-06 09:36:29,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:29,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:29,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:36:29,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:29,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -655616481, now seen corresponding path program 1 times [2025-02-06 09:36:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:29,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562141592] [2025-02-06 09:36:29,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:29,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:36:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:36:29,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:29,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:29,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562141592] [2025-02-06 09:36:29,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562141592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:29,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180026595] [2025-02-06 09:36:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:29,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:29,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:29,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:29,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-02-06 09:36:29,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:29,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:29,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:32,628 INFO L124 PetriNetUnfolderBase]: 8620/30231 cut-off events. [2025-02-06 09:36:32,629 INFO L125 PetriNetUnfolderBase]: For 11504/13519 co-relation queries the response was YES. [2025-02-06 09:36:32,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51447 conditions, 30231 events. 8620/30231 cut-off events. For 11504/13519 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 394843 event pairs, 4986 based on Foata normal form. 38/26920 useless extension candidates. Maximal degree in co-relation 50164. Up to 9839 conditions per place. [2025-02-06 09:36:32,807 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 38 selfloop transitions, 11 changer transitions 0/159 dead transitions. [2025-02-06 09:36:32,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 159 transitions, 569 flow [2025-02-06 09:36:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-02-06 09:36:32,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-02-06 09:36:32,808 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 392 flow. Second operand 3 states and 355 transitions. [2025-02-06 09:36:32,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 159 transitions, 569 flow [2025-02-06 09:36:32,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 159 transitions, 559 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:32,834 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 478 flow [2025-02-06 09:36:32,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-02-06 09:36:32,834 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 15 predicate places. [2025-02-06 09:36:32,834 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 478 flow [2025-02-06 09:36:32,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-02-06 09:36:32,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:32,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:36:32,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash 986531092, now seen corresponding path program 1 times [2025-02-06 09:36:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:32,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053623933] [2025-02-06 09:36:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:32,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:36:32,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:36:32,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:32,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:32,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053623933] [2025-02-06 09:36:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053623933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:32,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:32,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:36:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87084065] [2025-02-06 09:36:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:32,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:36:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:32,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:36:32,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:36:32,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:32,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 478 flow. Second operand has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-02-06 09:36:32,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:32,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:32,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:36,482 INFO L124 PetriNetUnfolderBase]: 9234/35955 cut-off events. [2025-02-06 09:36:36,482 INFO L125 PetriNetUnfolderBase]: For 10342/19346 co-relation queries the response was YES. [2025-02-06 09:36:36,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59421 conditions, 35955 events. 9234/35955 cut-off events. For 10342/19346 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 495386 event pairs, 2450 based on Foata normal form. 33/30935 useless extension candidates. Maximal degree in co-relation 28392. Up to 8114 conditions per place. [2025-02-06 09:36:36,678 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 55 selfloop transitions, 10 changer transitions 0/184 dead transitions. [2025-02-06 09:36:36,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 184 transitions, 690 flow [2025-02-06 09:36:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:36:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:36:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2025-02-06 09:36:36,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573643410852713 [2025-02-06 09:36:36,683 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 478 flow. Second operand 10 states and 1106 transitions. [2025-02-06 09:36:36,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 184 transitions, 690 flow [2025-02-06 09:36:36,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 184 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:36,711 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 504 flow [2025-02-06 09:36:36,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=504, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2025-02-06 09:36:36,712 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-02-06 09:36:36,712 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 504 flow [2025-02-06 09:36:36,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 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-02-06 09:36:36,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:36,712 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:36:36,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:36,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2004117395, now seen corresponding path program 1 times [2025-02-06 09:36:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677187369] [2025-02-06 09:36:36,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:36,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:36:36,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:36:36,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:36,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677187369] [2025-02-06 09:36:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677187369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:36,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:36:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950164421] [2025-02-06 09:36:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:36,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:36,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:36,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:36,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 129 [2025-02-06 09:36:36,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-02-06 09:36:36,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:36,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 129 [2025-02-06 09:36:36,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:37,198 INFO L124 PetriNetUnfolderBase]: 472/4722 cut-off events. [2025-02-06 09:36:37,199 INFO L125 PetriNetUnfolderBase]: For 1435/1689 co-relation queries the response was YES. [2025-02-06 09:36:37,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7181 conditions, 4722 events. 472/4722 cut-off events. For 1435/1689 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 50859 event pairs, 234 based on Foata normal form. 128/4386 useless extension candidates. Maximal degree in co-relation 6326. Up to 454 conditions per place. [2025-02-06 09:36:37,215 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 16 selfloop transitions, 8 changer transitions 0/149 dead transitions. [2025-02-06 09:36:37,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 149 transitions, 545 flow [2025-02-06 09:36:37,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-06 09:36:37,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405684754521964 [2025-02-06 09:36:37,217 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 504 flow. Second operand 3 states and 364 transitions. [2025-02-06 09:36:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 149 transitions, 545 flow [2025-02-06 09:36:37,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 519 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:36:37,225 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 440 flow [2025-02-06 09:36:37,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2025-02-06 09:36:37,225 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 21 predicate places. [2025-02-06 09:36:37,226 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 440 flow [2025-02-06 09:36:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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-02-06 09:36:37,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:37,226 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:37,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:36:37,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:37,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:37,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1152275173, now seen corresponding path program 1 times [2025-02-06 09:36:37,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:37,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384106589] [2025-02-06 09:36:37,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:37,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:36:37,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:36:37,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384106589] [2025-02-06 09:36:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384106589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853935562] [2025-02-06 09:36:37,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:37,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:37,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:37,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:37,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:37,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-02-06 09:36:37,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:37,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:37,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:37,839 INFO L124 PetriNetUnfolderBase]: 934/5912 cut-off events. [2025-02-06 09:36:37,839 INFO L125 PetriNetUnfolderBase]: For 3710/3812 co-relation queries the response was YES. [2025-02-06 09:36:37,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 5912 events. 934/5912 cut-off events. For 3710/3812 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 66659 event pairs, 666 based on Foata normal form. 4/5388 useless extension candidates. Maximal degree in co-relation 3816. Up to 1548 conditions per place. [2025-02-06 09:36:37,867 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2025-02-06 09:36:37,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 544 flow [2025-02-06 09:36:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2025-02-06 09:36:37,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8914728682170543 [2025-02-06 09:36:37,869 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 440 flow. Second operand 3 states and 345 transitions. [2025-02-06 09:36:37,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 544 flow [2025-02-06 09:36:37,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 149 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:36:37,872 INFO L231 Difference]: Finished difference. Result has 158 places, 145 transitions, 466 flow [2025-02-06 09:36:37,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=158, PETRI_TRANSITIONS=145} [2025-02-06 09:36:37,873 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 24 predicate places. [2025-02-06 09:36:37,873 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 145 transitions, 466 flow [2025-02-06 09:36:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-02-06 09:36:37,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:37,873 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:37,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:36:37,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1444419218, now seen corresponding path program 1 times [2025-02-06 09:36:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879249710] [2025-02-06 09:36:37,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:37,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 09:36:37,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 09:36:37,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:37,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879249710] [2025-02-06 09:36:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879249710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:37,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:36:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66310701] [2025-02-06 09:36:37,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:37,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:36:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:37,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:36:37,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:36:38,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-02-06 09:36:38,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 145 transitions, 466 flow. Second operand has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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-02-06 09:36:38,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:38,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-02-06 09:36:38,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:38,955 INFO L124 PetriNetUnfolderBase]: 1216/8139 cut-off events. [2025-02-06 09:36:38,955 INFO L125 PetriNetUnfolderBase]: For 3460/3688 co-relation queries the response was YES. [2025-02-06 09:36:38,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13552 conditions, 8139 events. 1216/8139 cut-off events. For 3460/3688 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 88378 event pairs, 223 based on Foata normal form. 20/7402 useless extension candidates. Maximal degree in co-relation 5488. Up to 893 conditions per place. [2025-02-06 09:36:39,007 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 76 selfloop transitions, 14 changer transitions 1/203 dead transitions. [2025-02-06 09:36:39,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 203 transitions, 824 flow [2025-02-06 09:36:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:36:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:36:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1431 transitions. [2025-02-06 09:36:39,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853309481216458 [2025-02-06 09:36:39,012 INFO L175 Difference]: Start difference. First operand has 158 places, 145 transitions, 466 flow. Second operand 13 states and 1431 transitions. [2025-02-06 09:36:39,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 203 transitions, 824 flow [2025-02-06 09:36:39,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 203 transitions, 812 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:39,020 INFO L231 Difference]: Finished difference. Result has 172 places, 148 transitions, 516 flow [2025-02-06 09:36:39,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=516, PETRI_PLACES=172, PETRI_TRANSITIONS=148} [2025-02-06 09:36:39,020 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 38 predicate places. [2025-02-06 09:36:39,021 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 148 transitions, 516 flow [2025-02-06 09:36:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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-02-06 09:36:39,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:39,021 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:39,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:36:39,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:39,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1901602830, now seen corresponding path program 1 times [2025-02-06 09:36:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346092801] [2025-02-06 09:36:39,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:39,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:39,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:36:39,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:36:39,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:39,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346092801] [2025-02-06 09:36:39,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346092801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:39,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:39,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52781998] [2025-02-06 09:36:39,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:39,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:39,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:39,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:39,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2025-02-06 09:36:39,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 148 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-02-06 09:36:39,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:39,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2025-02-06 09:36:39,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:39,718 INFO L124 PetriNetUnfolderBase]: 883/5630 cut-off events. [2025-02-06 09:36:39,718 INFO L125 PetriNetUnfolderBase]: For 4117/4213 co-relation queries the response was YES. [2025-02-06 09:36:39,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10508 conditions, 5630 events. 883/5630 cut-off events. For 4117/4213 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 61469 event pairs, 677 based on Foata normal form. 4/5132 useless extension candidates. Maximal degree in co-relation 9689. Up to 1476 conditions per place. [2025-02-06 09:36:39,763 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 30 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-02-06 09:36:39,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 154 transitions, 611 flow [2025-02-06 09:36:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-02-06 09:36:39,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-06 09:36:39,764 INFO L175 Difference]: Start difference. First operand has 172 places, 148 transitions, 516 flow. Second operand 3 states and 344 transitions. [2025-02-06 09:36:39,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 154 transitions, 611 flow [2025-02-06 09:36:39,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 581 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-02-06 09:36:39,779 INFO L231 Difference]: Finished difference. Result has 168 places, 151 transitions, 522 flow [2025-02-06 09:36:39,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=168, PETRI_TRANSITIONS=151} [2025-02-06 09:36:39,782 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 34 predicate places. [2025-02-06 09:36:39,782 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 522 flow [2025-02-06 09:36:39,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-02-06 09:36:39,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:39,782 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:36:39,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -220388779, now seen corresponding path program 1 times [2025-02-06 09:36:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982435183] [2025-02-06 09:36:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:36:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:36:39,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:39,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:39,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982435183] [2025-02-06 09:36:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982435183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672212509] [2025-02-06 09:36:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:39,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:36:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:39,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:36:39,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:36:40,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 129 [2025-02-06 09:36:40,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:40,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:40,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 129 [2025-02-06 09:36:40,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:40,834 INFO L124 PetriNetUnfolderBase]: 2726/11128 cut-off events. [2025-02-06 09:36:40,834 INFO L125 PetriNetUnfolderBase]: For 4547/4832 co-relation queries the response was YES. [2025-02-06 09:36:40,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21466 conditions, 11128 events. 2726/11128 cut-off events. For 4547/4832 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 121832 event pairs, 1342 based on Foata normal form. 0/10424 useless extension candidates. Maximal degree in co-relation 19173. Up to 2509 conditions per place. [2025-02-06 09:36:40,886 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 59 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-02-06 09:36:40,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 746 flow [2025-02-06 09:36:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:36:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:36:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-02-06 09:36:40,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8281653746770026 [2025-02-06 09:36:40,887 INFO L175 Difference]: Start difference. First operand has 168 places, 151 transitions, 522 flow. Second operand 6 states and 641 transitions. [2025-02-06 09:36:40,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 746 flow [2025-02-06 09:36:40,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 182 transitions, 732 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:40,906 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 518 flow [2025-02-06 09:36:40,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2025-02-06 09:36:40,906 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 36 predicate places. [2025-02-06 09:36:40,907 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 518 flow [2025-02-06 09:36:40,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:40,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:40,907 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 09:36:40,907 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -92497432, now seen corresponding path program 1 times [2025-02-06 09:36:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:40,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338167513] [2025-02-06 09:36:40,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:40,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:36:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:36:40,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:40,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338167513] [2025-02-06 09:36:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338167513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:36:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784662719] [2025-02-06 09:36:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:41,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 09:36:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:41,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 09:36:41,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:36:41,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2025-02-06 09:36:41,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 518 flow. Second operand has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-02-06 09:36:41,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:41,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2025-02-06 09:36:41,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:42,150 INFO L124 PetriNetUnfolderBase]: 1190/7524 cut-off events. [2025-02-06 09:36:42,150 INFO L125 PetriNetUnfolderBase]: For 4150/4378 co-relation queries the response was YES. [2025-02-06 09:36:42,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14306 conditions, 7524 events. 1190/7524 cut-off events. For 4150/4378 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 80719 event pairs, 159 based on Foata normal form. 48/7004 useless extension candidates. Maximal degree in co-relation 4960. Up to 557 conditions per place. [2025-02-06 09:36:42,190 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 90 selfloop transitions, 16 changer transitions 8/227 dead transitions. [2025-02-06 09:36:42,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 227 transitions, 974 flow [2025-02-06 09:36:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 09:36:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 09:36:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1763 transitions. [2025-02-06 09:36:42,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-02-06 09:36:42,194 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 518 flow. Second operand 16 states and 1763 transitions. [2025-02-06 09:36:42,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 227 transitions, 974 flow [2025-02-06 09:36:42,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 954 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 09:36:42,205 INFO L231 Difference]: Finished difference. Result has 176 places, 148 transitions, 518 flow [2025-02-06 09:36:42,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=518, PETRI_PLACES=176, PETRI_TRANSITIONS=148} [2025-02-06 09:36:42,205 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 42 predicate places. [2025-02-06 09:36:42,205 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 148 transitions, 518 flow [2025-02-06 09:36:42,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 105.0) internal successors, (1260), 12 states have internal predecessors, (1260), 0 states have call successors, (0), 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-02-06 09:36:42,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:42,206 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:42,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 09:36:42,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:42,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1191582646, now seen corresponding path program 1 times [2025-02-06 09:36:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389828153] [2025-02-06 09:36:42,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:42,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 09:36:42,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 09:36:42,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389828153] [2025-02-06 09:36:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389828153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:42,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:42,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:36:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591507446] [2025-02-06 09:36:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:42,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:36:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:42,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:36:42,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:36:42,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-02-06 09:36:42,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 148 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-02-06 09:36:42,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:42,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-02-06 09:36:42,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:43,213 INFO L124 PetriNetUnfolderBase]: 1353/8854 cut-off events. [2025-02-06 09:36:43,213 INFO L125 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-02-06 09:36:43,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16720 conditions, 8854 events. 1353/8854 cut-off events. For 5201/5285 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 105970 event pairs, 605 based on Foata normal form. 0/8294 useless extension candidates. Maximal degree in co-relation 15933. Up to 1591 conditions per place. [2025-02-06 09:36:43,258 INFO L140 encePairwiseOnDemand]: 122/129 looper letters, 30 selfloop transitions, 9 changer transitions 1/161 dead transitions. [2025-02-06 09:36:43,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 161 transitions, 652 flow [2025-02-06 09:36:43,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:36:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:36:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-02-06 09:36:43,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917312661498708 [2025-02-06 09:36:43,259 INFO L175 Difference]: Start difference. First operand has 176 places, 148 transitions, 518 flow. Second operand 3 states and 355 transitions. [2025-02-06 09:36:43,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 161 transitions, 652 flow [2025-02-06 09:36:43,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 584 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-02-06 09:36:43,296 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 526 flow [2025-02-06 09:36:43,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2025-02-06 09:36:43,297 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 25 predicate places. [2025-02-06 09:36:43,297 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 526 flow [2025-02-06 09:36:43,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-02-06 09:36:43,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:43,297 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:36:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 09:36:43,297 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash 26026049, now seen corresponding path program 1 times [2025-02-06 09:36:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045592533] [2025-02-06 09:36:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:36:43,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:36:43,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:36:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045592533] [2025-02-06 09:36:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045592533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:36:43,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:36:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:36:43,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729764031] [2025-02-06 09:36:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:36:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:36:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:43,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:36:43,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:36:43,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2025-02-06 09:36:43,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 526 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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-02-06 09:36:43,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:43,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2025-02-06 09:36:43,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:43,865 INFO L124 PetriNetUnfolderBase]: 806/5317 cut-off events. [2025-02-06 09:36:43,865 INFO L125 PetriNetUnfolderBase]: For 3505/3689 co-relation queries the response was YES. [2025-02-06 09:36:43,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 5317 events. 806/5317 cut-off events. For 3505/3689 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 53077 event pairs, 221 based on Foata normal form. 80/5250 useless extension candidates. Maximal degree in co-relation 9151. Up to 610 conditions per place. [2025-02-06 09:36:43,883 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 5 changer transitions 8/185 dead transitions. [2025-02-06 09:36:43,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 752 flow [2025-02-06 09:36:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:36:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:36:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2025-02-06 09:36:43,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116279069767442 [2025-02-06 09:36:43,887 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 526 flow. Second operand 5 states and 588 transitions. [2025-02-06 09:36:43,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 185 transitions, 752 flow [2025-02-06 09:36:43,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 185 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:36:43,892 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 528 flow [2025-02-06 09:36:43,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=162, PETRI_TRANSITIONS=153} [2025-02-06 09:36:43,893 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 28 predicate places. [2025-02-06 09:36:43,897 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 528 flow [2025-02-06 09:36:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 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-02-06 09:36:43,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:43,897 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 09:36:43,897 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2028201086, now seen corresponding path program 1 times [2025-02-06 09:36:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5869205] [2025-02-06 09:36:43,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:36:43,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:36:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5869205] [2025-02-06 09:36:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5869205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188410470] [2025-02-06 09:36:44,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:36:44,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:44,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:36:44,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:36:44,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:36:44,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:36:44,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:44,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:44,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 09:36:44,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:45,130 INFO L378 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 1 [2025-02-06 09:36:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:36:45,264 INFO L378 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 29 treesize of output 13 [2025-02-06 09:36:45,509 INFO L378 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 17 treesize of output 9 [2025-02-06 09:36:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:45,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:45,890 INFO L378 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 23 treesize of output 21 [2025-02-06 09:36:45,893 INFO L378 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 102 treesize of output 94 [2025-02-06 09:36:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188410470] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:46,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 55 [2025-02-06 09:36:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489959784] [2025-02-06 09:36:46,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:46,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 09:36:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:46,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 09:36:46,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 09:36:51,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 129 [2025-02-06 09:36:51,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 153 transitions, 528 flow. Second operand has 55 states, 55 states have (on average 96.69090909090909) internal successors, (5318), 55 states have internal predecessors, (5318), 0 states have call successors, (0), 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-02-06 09:36:51,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:51,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 129 [2025-02-06 09:36:51,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:53,393 INFO L124 PetriNetUnfolderBase]: 1748/7093 cut-off events. [2025-02-06 09:36:53,394 INFO L125 PetriNetUnfolderBase]: For 3922/4118 co-relation queries the response was YES. [2025-02-06 09:36:53,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14366 conditions, 7093 events. 1748/7093 cut-off events. For 3922/4118 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 69360 event pairs, 88 based on Foata normal form. 24/6912 useless extension candidates. Maximal degree in co-relation 6018. Up to 893 conditions per place. [2025-02-06 09:36:53,427 INFO L140 encePairwiseOnDemand]: 111/129 looper letters, 135 selfloop transitions, 28 changer transitions 8/278 dead transitions. [2025-02-06 09:36:53,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 278 transitions, 1239 flow [2025-02-06 09:36:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 09:36:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-02-06 09:36:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2521 transitions. [2025-02-06 09:36:53,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7817054263565891 [2025-02-06 09:36:53,431 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 528 flow. Second operand 25 states and 2521 transitions. [2025-02-06 09:36:53,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 278 transitions, 1239 flow [2025-02-06 09:36:53,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 278 transitions, 1229 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 09:36:53,451 INFO L231 Difference]: Finished difference. Result has 191 places, 161 transitions, 626 flow [2025-02-06 09:36:53,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=626, PETRI_PLACES=191, PETRI_TRANSITIONS=161} [2025-02-06 09:36:53,452 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 57 predicate places. [2025-02-06 09:36:53,452 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 161 transitions, 626 flow [2025-02-06 09:36:53,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 96.69090909090909) internal successors, (5318), 55 states have internal predecessors, (5318), 0 states have call successors, (0), 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-02-06 09:36:53,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:53,454 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:53,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:36:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:53,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:36:53,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1563319830, now seen corresponding path program 2 times [2025-02-06 09:36:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636276937] [2025-02-06 09:36:53,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:36:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:53,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-06 09:36:53,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:36:53,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:36:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:36:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636276937] [2025-02-06 09:36:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636276937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127523933] [2025-02-06 09:36:54,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:36:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:54,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:36:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:36:54,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-06 09:36:54,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:36:54,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:36:54,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:54,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 09:36:54,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:55,571 INFO L378 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 1 [2025-02-06 09:36:55,680 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-06 09:36:55,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-02-06 09:36:55,961 INFO L378 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 17 treesize of output 9 [2025-02-06 09:36:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:55,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:56,274 INFO L378 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 23 treesize of output 21 [2025-02-06 09:36:56,277 INFO L378 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 102 treesize of output 94 [2025-02-06 09:36:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127523933] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:56,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 21] total 57 [2025-02-06 09:36:56,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874122622] [2025-02-06 09:36:56,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 09:36:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:56,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 09:36:56,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2873, Unknown=0, NotChecked=0, Total=3192 [2025-02-06 09:36:58,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:37:00,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:37:01,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:37:03,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:37:04,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:37:07,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 129 [2025-02-06 09:37:07,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 161 transitions, 626 flow. Second operand has 57 states, 57 states have (on average 90.24561403508773) internal successors, (5144), 57 states have internal predecessors, (5144), 0 states have call successors, (0), 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-02-06 09:37:07,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:37:07,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 129 [2025-02-06 09:37:07,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:37:10,357 INFO L124 PetriNetUnfolderBase]: 1532/5648 cut-off events. [2025-02-06 09:37:10,358 INFO L125 PetriNetUnfolderBase]: For 3778/3886 co-relation queries the response was YES. [2025-02-06 09:37:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12515 conditions, 5648 events. 1532/5648 cut-off events. For 3778/3886 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 50085 event pairs, 4 based on Foata normal form. 36/5605 useless extension candidates. Maximal degree in co-relation 7173. Up to 796 conditions per place. [2025-02-06 09:37:10,387 INFO L140 encePairwiseOnDemand]: 107/129 looper letters, 188 selfloop transitions, 41 changer transitions 16/347 dead transitions. [2025-02-06 09:37:10,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 347 transitions, 1689 flow [2025-02-06 09:37:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 09:37:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-06 09:37:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3466 transitions. [2025-02-06 09:37:10,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261680284936098 [2025-02-06 09:37:10,393 INFO L175 Difference]: Start difference. First operand has 191 places, 161 transitions, 626 flow. Second operand 37 states and 3466 transitions. [2025-02-06 09:37:10,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 347 transitions, 1689 flow [2025-02-06 09:37:10,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 347 transitions, 1647 flow, removed 1 selfloop flow, removed 17 redundant places. [2025-02-06 09:37:10,403 INFO L231 Difference]: Finished difference. Result has 214 places, 168 transitions, 720 flow [2025-02-06 09:37:10,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=720, PETRI_PLACES=214, PETRI_TRANSITIONS=168} [2025-02-06 09:37:10,403 INFO L279 CegarLoopForPetriNet]: 134 programPoint places, 80 predicate places. [2025-02-06 09:37:10,404 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 168 transitions, 720 flow [2025-02-06 09:37:10,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 90.24561403508773) internal successors, (5144), 57 states have internal predecessors, (5144), 0 states have call successors, (0), 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-02-06 09:37:10,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:37:10,406 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:10,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:37:10,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:37:10,610 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:37:10,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:37:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash -662142013, now seen corresponding path program 1 times [2025-02-06 09:37:10,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:37:10,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691744746] [2025-02-06 09:37:10,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:37:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:37:10,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:37:10,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:37:10,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:10,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:10,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:37:10,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:37:10,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:37:10,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:37:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:37:10,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:37:10,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-06 09:37:10,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-06 09:37:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 09:37:10,695 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:37:10,809 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-02-06 09:37:10,809 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:37:10,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:37:10 BasicIcfg [2025-02-06 09:37:10,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:37:10,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:37:10,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:37:10,815 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:37:10,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:36:13" (3/4) ... [2025-02-06 09:37:10,817 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:37:10,904 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 09:37:10,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:37:10,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:37:10,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:37:10,945 INFO L158 Benchmark]: Toolchain (without parser) took 57798.30ms. Allocated memory was 142.6MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 105.6MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2025-02-06 09:37:10,945 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:37:10,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.72ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:37:10,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.42ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:37:10,945 INFO L158 Benchmark]: Boogie Preprocessor took 24.41ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:37:10,946 INFO L158 Benchmark]: IcfgBuilder took 309.25ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 68.5MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:37:10,946 INFO L158 Benchmark]: TraceAbstraction took 57002.13ms. Allocated memory was 142.6MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 67.9MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-02-06 09:37:10,946 INFO L158 Benchmark]: Witness Printer took 129.18ms. Allocated memory is still 8.5GB. Free memory was 6.6GB in the beginning and 6.5GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 09:37:10,947 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.72ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 86.2MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.42ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.41ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 309.25ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 68.5MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57002.13ms. Allocated memory was 142.6MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 67.9MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 129.18ms. Allocated memory is still 8.5GB. Free memory was 6.6GB in the beginning and 6.5GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 92 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 8 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 109 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 35 mSDtfsCounter, 587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 126 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1196 IncrementalHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 96 mSDtfsCounter, 1196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 39/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 143 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 49.5s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 42.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 4564 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4201 mSDsluCounter, 7210 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7077 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36275 IncrementalHoareTripleChecker+Invalid, 36350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 133 mSDtfsCounter, 36275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 786 GetRequests, 549 SyntacticMatches, 3 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4133 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=720occurred in iteration=17, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1730 NumberOfCodeBlocks, 1730 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1857 ConstructedInterpolants, 36 QuantifiedInterpolants, 12133 SizeOfPredicates, 39 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 10/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 09:37:10,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)