./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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-theta/unwind3-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:40:56,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:40:56,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:40:56,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:40:56,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:40:56,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:40:56,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:40:56,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:40:56,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:40:56,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:40:56,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:40:56,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:40:56,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:40:56,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:56,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:56,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:40:56,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:40:56,508 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2025-01-09 21:40:56,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:40:56,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:40:56,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:40:56,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:40:56,729 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:40:56,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-01-09 21:40:57,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad22341b/943686405538496298992d2c7ccfc48b/FLAGfe9bce765 [2025-01-09 21:40:58,208 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:40:58,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-01-09 21:40:58,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad22341b/943686405538496298992d2c7ccfc48b/FLAGfe9bce765 [2025-01-09 21:40:58,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bad22341b/943686405538496298992d2c7ccfc48b [2025-01-09 21:40:58,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:40:58,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:40:58,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:40:58,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:40:58,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:40:58,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ade8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58, skipping insertion in model container [2025-01-09 21:40:58,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:40:58,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:40:58,470 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:40:58,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:40:58,526 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:40:58,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58 WrapperNode [2025-01-09 21:40:58,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:40:58,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:40:58,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:40:58,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:40:58,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,557 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2025-01-09 21:40:58,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:40:58,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:40:58,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:40:58,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:40:58,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:40:58,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:40:58,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:40:58,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:40:58,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (1/1) ... [2025-01-09 21:40:58,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:40:58,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:40:58,627 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-01-09 21:40:58,631 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-01-09 21:40:58,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:40:58,643 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 21:40:58,643 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 21:40:58,643 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 21:40:58,643 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 21:40:58,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:40:58,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:40:58,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:40:58,644 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:40:58,716 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:40:58,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:40:58,829 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:40:58,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:40:58,838 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:40:58,838 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:40:58,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:58 BoogieIcfgContainer [2025-01-09 21:40:58,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:40:58,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:40:58,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:40:58,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:40:58,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:40:58" (1/3) ... [2025-01-09 21:40:58,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef21ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:58, skipping insertion in model container [2025-01-09 21:40:58,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:58" (2/3) ... [2025-01-09 21:40:58,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eef21ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:58, skipping insertion in model container [2025-01-09 21:40:58,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:58" (3/3) ... [2025-01-09 21:40:58,846 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-01-09 21:40:58,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:40:58,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 102 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-09 21:40:58,858 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:40:58,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:58,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 108 transitions, 224 flow [2025-01-09 21:40:58,980 INFO L124 PetriNetUnfolderBase]: 10/157 cut-off events. [2025-01-09 21:40:58,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:58,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 10/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 257 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-01-09 21:40:58,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 108 transitions, 224 flow [2025-01-09 21:40:58,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 91 transitions, 189 flow [2025-01-09 21:40:58,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:58,998 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:58,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:40:59,001 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:59,001 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:40:59,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:59,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -193659709, now seen corresponding path program 1 times [2025-01-09 21:40:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-01-09 21:40:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:40:59,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:40:59,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-01-09 21:40:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267241065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802137587] [2025-01-09 21:40:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 108 [2025-01-09 21:40:59,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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-01-09 21:40:59,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 108 [2025-01-09 21:40:59,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,275 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-01-09 21:40:59,276 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:40:59,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 193 event pairs, 2 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 96. Up to 20 conditions per place. [2025-01-09 21:40:59,279 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 11 selfloop transitions, 2 changer transitions 1/88 dead transitions. [2025-01-09 21:40:59,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 209 flow [2025-01-09 21:40:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-01-09 21:40:59,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734567901234568 [2025-01-09 21:40:59,294 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 189 flow. Second operand 3 states and 283 transitions. [2025-01-09 21:40:59,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 209 flow [2025-01-09 21:40:59,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,300 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 184 flow [2025-01-09 21:40:59,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-01-09 21:40:59,304 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2025-01-09 21:40:59,304 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 184 flow [2025-01-09 21:40:59,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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-01-09 21:40:59,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,305 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] [2025-01-09 21:40:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:40:59,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:59,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2067106487, now seen corresponding path program 1 times [2025-01-09 21:40:59,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-01-09 21:40:59,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:40:59,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:40:59,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-01-09 21:40:59,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112971937] [2025-01-09 21:40:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 108 [2025-01-09 21:40:59,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-01-09 21:40:59,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 108 [2025-01-09 21:40:59,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,395 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-01-09 21:40:59,395 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:40:59,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 113 events. 3/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 116. Up to 15 conditions per place. [2025-01-09 21:40:59,396 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 9 selfloop transitions, 1 changer transitions 24/82 dead transitions. [2025-01-09 21:40:59,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 198 flow [2025-01-09 21:40:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2025-01-09 21:40:59,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395061728395061 [2025-01-09 21:40:59,401 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 184 flow. Second operand 3 states and 272 transitions. [2025-01-09 21:40:59,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 198 flow [2025-01-09 21:40:59,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:59,402 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 122 flow [2025-01-09 21:40:59,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2025-01-09 21:40:59,403 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2025-01-09 21:40:59,403 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 122 flow [2025-01-09 21:40:59,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-01-09 21:40:59,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,403 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 21:40:59,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:40:59,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:59,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -781418271, now seen corresponding path program 1 times [2025-01-09 21:40:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-01-09 21:40:59,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:40:59,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:40:59,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:59,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408619316] [2025-01-09 21:40:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408619316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:40:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094174108] [2025-01-09 21:40:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:40:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:40:59,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:40:59,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 108 [2025-01-09 21:40:59,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-01-09 21:40:59,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 108 [2025-01-09 21:40:59,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,636 INFO L124 PetriNetUnfolderBase]: 0/78 cut-off events. [2025-01-09 21:40:59,636 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:40:59,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 78 events. 0/78 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 39 event pairs, 0 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2025-01-09 21:40:59,637 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 9 selfloop transitions, 2 changer transitions 3/60 dead transitions. [2025-01-09 21:40:59,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 154 flow [2025-01-09 21:40:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:40:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:40:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2025-01-09 21:40:59,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2025-01-09 21:40:59,638 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 122 flow. Second operand 5 states and 455 transitions. [2025-01-09 21:40:59,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 154 flow [2025-01-09 21:40:59,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,640 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 127 flow [2025-01-09 21:40:59,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-01-09 21:40:59,640 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2025-01-09 21:40:59,640 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 127 flow [2025-01-09 21:40:59,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 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-01-09 21:40:59,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,641 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 21:40:59,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:40:59,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:40:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash 78895996, now seen corresponding path program 1 times [2025-01-09 21:40:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490892710] [2025-01-09 21:40:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:40:59,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:40:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:40:59,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:40:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:40:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:40:59,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:40:59,685 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:40:59,685 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-09 21:40:59,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:40:59,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:40:59,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:40:59,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-01-09 21:40:59,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:40:59,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-01-09 21:40:59,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:40:59,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:40:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:40:59,689 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:40:59,691 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:40:59,693 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:40:59,724 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:40:59,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 308 flow [2025-01-09 21:40:59,757 INFO L124 PetriNetUnfolderBase]: 14/220 cut-off events. [2025-01-09 21:40:59,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:40:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 220 events. 14/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 231. Up to 6 conditions per place. [2025-01-09 21:40:59,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 308 flow [2025-01-09 21:40:59,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 98 transitions, 209 flow [2025-01-09 21:40:59,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:40:59,763 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:40:59,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:40:59,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:40:59,766 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:40:59,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:40:59,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:59,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1428714301, now seen corresponding path program 1 times [2025-01-09 21:40:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-01-09 21:40:59,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:40:59,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:40:59,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-01-09 21:40:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146685224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470126611] [2025-01-09 21:40:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 144 [2025-01-09 21:40:59,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-01-09 21:40:59,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 144 [2025-01-09 21:40:59,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,877 INFO L124 PetriNetUnfolderBase]: 7/176 cut-off events. [2025-01-09 21:40:59,877 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:40:59,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 176 events. 7/176 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs, 3 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 153. Up to 27 conditions per place. [2025-01-09 21:40:59,879 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 12 selfloop transitions, 2 changer transitions 1/95 dead transitions. [2025-01-09 21:40:59,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 231 flow [2025-01-09 21:40:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-09 21:40:59,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8657407407407407 [2025-01-09 21:40:59,881 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 209 flow. Second operand 3 states and 374 transitions. [2025-01-09 21:40:59,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 231 flow [2025-01-09 21:40:59,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:40:59,883 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 204 flow [2025-01-09 21:40:59,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-01-09 21:40:59,888 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2025-01-09 21:40:59,888 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 204 flow [2025-01-09 21:40:59,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-01-09 21:40:59,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,888 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] [2025-01-09 21:40:59,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:40:59,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:59,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 665364809, now seen corresponding path program 1 times [2025-01-09 21:40:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123250217] [2025-01-09 21:40:59,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:40:59,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:40:59,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:59,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123250217] [2025-01-09 21:40:59,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123250217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:59,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:59,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927490027] [2025-01-09 21:40:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:59,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:59,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:59,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:59,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 144 [2025-01-09 21:40:59,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-01-09 21:40:59,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:59,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 144 [2025-01-09 21:40:59,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:59,958 INFO L124 PetriNetUnfolderBase]: 4/157 cut-off events. [2025-01-09 21:40:59,958 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:40:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 157 events. 4/157 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 234 event pairs, 0 based on Foata normal form. 3/153 useless extension candidates. Maximal degree in co-relation 170. Up to 20 conditions per place. [2025-01-09 21:40:59,959 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 10 selfloop transitions, 1 changer transitions 24/89 dead transitions. [2025-01-09 21:40:59,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 220 flow [2025-01-09 21:40:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-01-09 21:40:59,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2025-01-09 21:40:59,960 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 204 flow. Second operand 3 states and 357 transitions. [2025-01-09 21:40:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 89 transitions, 220 flow [2025-01-09 21:40:59,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:59,962 INFO L231 Difference]: Finished difference. Result has 96 places, 65 transitions, 142 flow [2025-01-09 21:40:59,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=96, PETRI_TRANSITIONS=65} [2025-01-09 21:40:59,962 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -6 predicate places. [2025-01-09 21:40:59,962 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 65 transitions, 142 flow [2025-01-09 21:40:59,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-01-09 21:40:59,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:59,963 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:59,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:40:59,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:40:59,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -381745139, now seen corresponding path program 1 times [2025-01-09 21:40:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:59,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073809276] [2025-01-09 21:40:59,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:59,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:40:59,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:40:59,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073809276] [2025-01-09 21:41:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073809276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64092446] [2025-01-09 21:41:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:00,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:00,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 144 [2025-01-09 21:41:00,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 65 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-01-09 21:41:00,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 144 [2025-01-09 21:41:00,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,116 INFO L124 PetriNetUnfolderBase]: 0/98 cut-off events. [2025-01-09 21:41:00,116 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:41:00,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 98 events. 0/98 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 52 event pairs, 0 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2025-01-09 21:41:00,116 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 10 selfloop transitions, 2 changer transitions 3/67 dead transitions. [2025-01-09 21:41:00,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 67 transitions, 176 flow [2025-01-09 21:41:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2025-01-09 21:41:00,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486111111111111 [2025-01-09 21:41:00,118 INFO L175 Difference]: Start difference. First operand has 96 places, 65 transitions, 142 flow. Second operand 5 states and 611 transitions. [2025-01-09 21:41:00,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 67 transitions, 176 flow [2025-01-09 21:41:00,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 67 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,119 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 147 flow [2025-01-09 21:41:00,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-01-09 21:41:00,119 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, -26 predicate places. [2025-01-09 21:41:00,119 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 147 flow [2025-01-09 21:41:00,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-01-09 21:41:00,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,120 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:41:00,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:41:00,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,120 INFO L85 PathProgramCache]: Analyzing trace with hash -263511336, now seen corresponding path program 1 times [2025-01-09 21:41:00,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913828913] [2025-01-09 21:41:00,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:41:00,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:41:00,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:41:00,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:41:00,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:00,151 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2025-01-09 21:41:00,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:41:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:41:00,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:41:00,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:41:00,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:00,152 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:00,152 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:41:00,172 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:00,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 180 transitions, 396 flow [2025-01-09 21:41:00,208 INFO L124 PetriNetUnfolderBase]: 18/283 cut-off events. [2025-01-09 21:41:00,209 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:41:00,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 283 events. 18/283 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 643 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 300. Up to 8 conditions per place. [2025-01-09 21:41:00,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 180 transitions, 396 flow [2025-01-09 21:41:00,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 105 transitions, 231 flow [2025-01-09 21:41:00,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:00,211 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:00,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:41:00,212 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:00,212 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:00,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:00,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:41:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1898790717, now seen corresponding path program 1 times [2025-01-09 21:41:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670563661] [2025-01-09 21:41:00,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670563661] [2025-01-09 21:41:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670563661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107710774] [2025-01-09 21:41:00,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2025-01-09 21:41:00,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-01-09 21:41:00,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2025-01-09 21:41:00,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,276 INFO L124 PetriNetUnfolderBase]: 9/225 cut-off events. [2025-01-09 21:41:00,276 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:41:00,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 225 events. 9/225 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 469 event pairs, 4 based on Foata normal form. 1/205 useless extension candidates. Maximal degree in co-relation 214. Up to 34 conditions per place. [2025-01-09 21:41:00,277 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 13 selfloop transitions, 2 changer transitions 1/102 dead transitions. [2025-01-09 21:41:00,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 255 flow [2025-01-09 21:41:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-01-09 21:41:00,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2025-01-09 21:41:00,278 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 231 flow. Second operand 3 states and 465 transitions. [2025-01-09 21:41:00,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 255 flow [2025-01-09 21:41:00,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 252 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,280 INFO L231 Difference]: Finished difference. Result has 111 places, 101 transitions, 224 flow [2025-01-09 21:41:00,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2025-01-09 21:41:00,280 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2025-01-09 21:41:00,280 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 224 flow [2025-01-09 21:41:00,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 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-01-09 21:41:00,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,280 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] [2025-01-09 21:41:00,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:41:00,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:41:00,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1933470281, now seen corresponding path program 1 times [2025-01-09 21:41:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-01-09 21:41:00,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:00,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:00,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-01-09 21:41:00,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034034789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134580648] [2025-01-09 21:41:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-01-09 21:41:00,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-01-09 21:41:00,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-01-09 21:41:00,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,343 INFO L124 PetriNetUnfolderBase]: 5/201 cut-off events. [2025-01-09 21:41:00,343 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:41:00,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 201 events. 5/201 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 341 event pairs, 0 based on Foata normal form. 4/196 useless extension candidates. Maximal degree in co-relation 224. Up to 25 conditions per place. [2025-01-09 21:41:00,344 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 11 selfloop transitions, 1 changer transitions 24/96 dead transitions. [2025-01-09 21:41:00,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 242 flow [2025-01-09 21:41:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-01-09 21:41:00,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8185185185185185 [2025-01-09 21:41:00,345 INFO L175 Difference]: Start difference. First operand has 111 places, 101 transitions, 224 flow. Second operand 3 states and 442 transitions. [2025-01-09 21:41:00,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 242 flow [2025-01-09 21:41:00,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 96 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:00,346 INFO L231 Difference]: Finished difference. Result has 105 places, 72 transitions, 162 flow [2025-01-09 21:41:00,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=105, PETRI_TRANSITIONS=72} [2025-01-09 21:41:00,347 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-01-09 21:41:00,347 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 72 transitions, 162 flow [2025-01-09 21:41:00,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-01-09 21:41:00,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,348 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:41:00,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:41:00,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -583747420, now seen corresponding path program 1 times [2025-01-09 21:41:00,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-01-09 21:41:00,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:41:00,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:41:00,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146524335] [2025-01-09 21:41:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146524335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832913749] [2025-01-09 21:41:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:00,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:00,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:00,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 180 [2025-01-09 21:41:00,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 72 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 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-01-09 21:41:00,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 180 [2025-01-09 21:41:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,474 INFO L124 PetriNetUnfolderBase]: 0/118 cut-off events. [2025-01-09 21:41:00,474 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:41:00,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 118 events. 0/118 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 63 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2025-01-09 21:41:00,475 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 11 selfloop transitions, 2 changer transitions 3/74 dead transitions. [2025-01-09 21:41:00,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 198 flow [2025-01-09 21:41:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2025-01-09 21:41:00,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8522222222222222 [2025-01-09 21:41:00,476 INFO L175 Difference]: Start difference. First operand has 105 places, 72 transitions, 162 flow. Second operand 5 states and 767 transitions. [2025-01-09 21:41:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 198 flow [2025-01-09 21:41:00,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,477 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 167 flow [2025-01-09 21:41:00,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2025-01-09 21:41:00,478 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -26 predicate places. [2025-01-09 21:41:00,478 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 167 flow [2025-01-09 21:41:00,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 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-01-09 21:41:00,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,478 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:41:00,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:41:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 272024955, now seen corresponding path program 1 times [2025-01-09 21:41:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676140369] [2025-01-09 21:41:00,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:41:00,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:41:00,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:41:00,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:41:00,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:00,501 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:41:00,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:41:00,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:41:00,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:41:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:41:00,502 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:00,502 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:00,502 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:41:00,526 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:00,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 216 transitions, 488 flow [2025-01-09 21:41:00,544 INFO L124 PetriNetUnfolderBase]: 22/346 cut-off events. [2025-01-09 21:41:00,544 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:41:00,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 346 events. 22/346 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 858 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 370. Up to 10 conditions per place. [2025-01-09 21:41:00,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 216 transitions, 488 flow [2025-01-09 21:41:00,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 255 flow [2025-01-09 21:41:00,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:00,546 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:00,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:41:00,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:00,547 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:00,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:00,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:41:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1603888957, now seen corresponding path program 1 times [2025-01-09 21:41:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453194503] [2025-01-09 21:41:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:00,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:00,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453194503] [2025-01-09 21:41:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453194503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912618994] [2025-01-09 21:41:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216 [2025-01-09 21:41:00,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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-01-09 21:41:00,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216 [2025-01-09 21:41:00,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,630 INFO L124 PetriNetUnfolderBase]: 11/274 cut-off events. [2025-01-09 21:41:00,630 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:41:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 274 events. 11/274 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 608 event pairs, 5 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 276. Up to 41 conditions per place. [2025-01-09 21:41:00,631 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 14 selfloop transitions, 2 changer transitions 1/109 dead transitions. [2025-01-09 21:41:00,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 109 transitions, 281 flow [2025-01-09 21:41:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2025-01-09 21:41:00,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580246913580247 [2025-01-09 21:41:00,632 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 255 flow. Second operand 3 states and 556 transitions. [2025-01-09 21:41:00,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 109 transitions, 281 flow [2025-01-09 21:41:00,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 109 transitions, 274 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,634 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 244 flow [2025-01-09 21:41:00,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-01-09 21:41:00,634 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2025-01-09 21:41:00,634 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 244 flow [2025-01-09 21:41:00,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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-01-09 21:41:00,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,635 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] [2025-01-09 21:41:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:41:00,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:41:00,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1737209929, now seen corresponding path program 1 times [2025-01-09 21:41:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623444234] [2025-01-09 21:41:00,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623444234] [2025-01-09 21:41:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623444234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845635704] [2025-01-09 21:41:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:00,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-01-09 21:41:00,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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-01-09 21:41:00,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-01-09 21:41:00,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,710 INFO L124 PetriNetUnfolderBase]: 6/245 cut-off events. [2025-01-09 21:41:00,710 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:41:00,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 245 events. 6/245 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 443 event pairs, 0 based on Foata normal form. 5/239 useless extension candidates. Maximal degree in co-relation 278. Up to 30 conditions per place. [2025-01-09 21:41:00,710 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 12 selfloop transitions, 1 changer transitions 24/103 dead transitions. [2025-01-09 21:41:00,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 264 flow [2025-01-09 21:41:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:41:00,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8132716049382716 [2025-01-09 21:41:00,712 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 244 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:41:00,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 264 flow [2025-01-09 21:41:00,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:00,713 INFO L231 Difference]: Finished difference. Result has 114 places, 79 transitions, 182 flow [2025-01-09 21:41:00,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=114, PETRI_TRANSITIONS=79} [2025-01-09 21:41:00,714 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -6 predicate places. [2025-01-09 21:41:00,714 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 79 transitions, 182 flow [2025-01-09 21:41:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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-01-09 21:41:00,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,714 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:41:00,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:41:00,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 903738022, now seen corresponding path program 1 times [2025-01-09 21:41:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868057242] [2025-01-09 21:41:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:41:00,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:41:00,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868057242] [2025-01-09 21:41:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868057242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546822345] [2025-01-09 21:41:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:00,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:00,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 216 [2025-01-09 21:41:00,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 79 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 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-01-09 21:41:00,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:00,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 216 [2025-01-09 21:41:00,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:00,842 INFO L124 PetriNetUnfolderBase]: 0/138 cut-off events. [2025-01-09 21:41:00,842 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:41:00,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 138 events. 0/138 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 75 event pairs, 0 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2025-01-09 21:41:00,843 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 12 selfloop transitions, 2 changer transitions 3/81 dead transitions. [2025-01-09 21:41:00,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 81 transitions, 220 flow [2025-01-09 21:41:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 923 transitions. [2025-01-09 21:41:00,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8546296296296296 [2025-01-09 21:41:00,844 INFO L175 Difference]: Start difference. First operand has 114 places, 79 transitions, 182 flow. Second operand 5 states and 923 transitions. [2025-01-09 21:41:00,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 81 transitions, 220 flow [2025-01-09 21:41:00,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 81 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:00,845 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 187 flow [2025-01-09 21:41:00,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-01-09 21:41:00,846 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -26 predicate places. [2025-01-09 21:41:00,846 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 187 flow [2025-01-09 21:41:00,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 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-01-09 21:41:00,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,846 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:41:00,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:41:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1902825573, now seen corresponding path program 1 times [2025-01-09 21:41:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085670] [2025-01-09 21:41:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:41:00,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:41:00,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:00,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:41:00,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:41:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:00,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:00,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:41:00,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:41:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:41:00,875 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:00,875 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:00,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-09 21:41:00,907 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:00,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 252 transitions, 584 flow [2025-01-09 21:41:00,937 INFO L124 PetriNetUnfolderBase]: 26/409 cut-off events. [2025-01-09 21:41:00,937 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-09 21:41:00,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 409 events. 26/409 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1041 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 441. Up to 12 conditions per place. [2025-01-09 21:41:00,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 252 transitions, 584 flow [2025-01-09 21:41:00,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 119 transitions, 281 flow [2025-01-09 21:41:00,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:00,939 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:00,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-09 21:41:00,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:00,940 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:00,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:00,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:00,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:00,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:41:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -544009021, now seen corresponding path program 1 times [2025-01-09 21:41:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400878363] [2025-01-09 21:41:00,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:00,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:00,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:00,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400878363] [2025-01-09 21:41:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400878363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:00,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-01-09 21:41:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:00,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:00,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 252 [2025-01-09 21:41:01,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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-01-09 21:41:01,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 252 [2025-01-09 21:41:01,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,044 INFO L124 PetriNetUnfolderBase]: 13/323 cut-off events. [2025-01-09 21:41:01,044 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:41:01,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 323 events. 13/323 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 748 event pairs, 6 based on Foata normal form. 1/295 useless extension candidates. Maximal degree in co-relation 339. Up to 48 conditions per place. [2025-01-09 21:41:01,045 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 15 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-01-09 21:41:01,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 116 transitions, 309 flow [2025-01-09 21:41:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-01-09 21:41:01,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558201058201058 [2025-01-09 21:41:01,047 INFO L175 Difference]: Start difference. First operand has 129 places, 119 transitions, 281 flow. Second operand 3 states and 647 transitions. [2025-01-09 21:41:01,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 116 transitions, 309 flow [2025-01-09 21:41:01,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 116 transitions, 296 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,049 INFO L231 Difference]: Finished difference. Result has 129 places, 115 transitions, 264 flow [2025-01-09 21:41:01,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=129, PETRI_TRANSITIONS=115} [2025-01-09 21:41:01,049 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 0 predicate places. [2025-01-09 21:41:01,049 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 115 transitions, 264 flow [2025-01-09 21:41:01,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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-01-09 21:41:01,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,050 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] [2025-01-09 21:41:01,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:41:01,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:41:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 76583753, now seen corresponding path program 1 times [2025-01-09 21:41:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-01-09 21:41:01,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:01,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-01-09 21:41:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201652749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041406986] [2025-01-09 21:41:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 252 [2025-01-09 21:41:01,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 115 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-01-09 21:41:01,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 252 [2025-01-09 21:41:01,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,113 INFO L124 PetriNetUnfolderBase]: 7/289 cut-off events. [2025-01-09 21:41:01,113 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:41:01,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 289 events. 7/289 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 546 event pairs, 0 based on Foata normal form. 6/282 useless extension candidates. Maximal degree in co-relation 332. Up to 35 conditions per place. [2025-01-09 21:41:01,114 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 13 selfloop transitions, 1 changer transitions 24/110 dead transitions. [2025-01-09 21:41:01,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 110 transitions, 286 flow [2025-01-09 21:41:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-01-09 21:41:01,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-01-09 21:41:01,115 INFO L175 Difference]: Start difference. First operand has 129 places, 115 transitions, 264 flow. Second operand 3 states and 612 transitions. [2025-01-09 21:41:01,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 110 transitions, 286 flow [2025-01-09 21:41:01,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 110 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:01,116 INFO L231 Difference]: Finished difference. Result has 123 places, 86 transitions, 202 flow [2025-01-09 21:41:01,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=123, PETRI_TRANSITIONS=86} [2025-01-09 21:41:01,117 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -6 predicate places. [2025-01-09 21:41:01,117 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 86 transitions, 202 flow [2025-01-09 21:41:01,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-01-09 21:41:01,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,117 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:01,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:41:01,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:41:01,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash 460301843, now seen corresponding path program 1 times [2025-01-09 21:41:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47282901] [2025-01-09 21:41:01,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 21:41:01,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 21:41:01,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47282901] [2025-01-09 21:41:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47282901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001586961] [2025-01-09 21:41:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:01,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:01,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 252 [2025-01-09 21:41:01,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 86 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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-01-09 21:41:01,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 252 [2025-01-09 21:41:01,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,272 INFO L124 PetriNetUnfolderBase]: 0/158 cut-off events. [2025-01-09 21:41:01,272 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:41:01,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 158 events. 0/158 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 88 event pairs, 0 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 0. Up to 23 conditions per place. [2025-01-09 21:41:01,280 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 13 selfloop transitions, 2 changer transitions 3/88 dead transitions. [2025-01-09 21:41:01,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 242 flow [2025-01-09 21:41:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1079 transitions. [2025-01-09 21:41:01,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8563492063492063 [2025-01-09 21:41:01,282 INFO L175 Difference]: Start difference. First operand has 123 places, 86 transitions, 202 flow. Second operand 5 states and 1079 transitions. [2025-01-09 21:41:01,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 242 flow [2025-01-09 21:41:01,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 88 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,283 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 207 flow [2025-01-09 21:41:01,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2025-01-09 21:41:01,284 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, -26 predicate places. [2025-01-09 21:41:01,284 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 207 flow [2025-01-09 21:41:01,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 0 states have call successors, (0), 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-01-09 21:41:01,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,284 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:01,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:41:01,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-01-09 21:41:01,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash -518365034, now seen corresponding path program 1 times [2025-01-09 21:41:01,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054947771] [2025-01-09 21:41:01,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:41:01,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:41:01,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:01,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:41:01,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:41:01,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:01,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-01-09 21:41:01,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-01-09 21:41:01,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-01-09 21:41:01,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-01-09 21:41:01,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-01-09 21:41:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:41:01,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:01,321 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:01,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-09 21:41:01,362 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:01,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 293 places, 288 transitions, 684 flow [2025-01-09 21:41:01,408 INFO L124 PetriNetUnfolderBase]: 30/472 cut-off events. [2025-01-09 21:41:01,409 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:41:01,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 472 events. 30/472 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1254 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 513. Up to 14 conditions per place. [2025-01-09 21:41:01,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 293 places, 288 transitions, 684 flow [2025-01-09 21:41:01,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 309 flow [2025-01-09 21:41:01,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:01,411 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:01,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:41:01,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:01,412 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:01,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:01,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1280849091, now seen corresponding path program 1 times [2025-01-09 21:41:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-01-09 21:41:01,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:01,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:01,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-01-09 21:41:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776126014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479692753] [2025-01-09 21:41:01,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 288 [2025-01-09 21:41:01,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 126 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 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-01-09 21:41:01,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 288 [2025-01-09 21:41:01,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,497 INFO L124 PetriNetUnfolderBase]: 15/372 cut-off events. [2025-01-09 21:41:01,497 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-09 21:41:01,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 372 events. 15/372 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 884 event pairs, 7 based on Foata normal form. 1/340 useless extension candidates. Maximal degree in co-relation 403. Up to 55 conditions per place. [2025-01-09 21:41:01,498 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 16 selfloop transitions, 2 changer transitions 1/123 dead transitions. [2025-01-09 21:41:01,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 123 transitions, 339 flow [2025-01-09 21:41:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2025-01-09 21:41:01,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-01-09 21:41:01,499 INFO L175 Difference]: Start difference. First operand has 138 places, 126 transitions, 309 flow. Second operand 3 states and 738 transitions. [2025-01-09 21:41:01,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 123 transitions, 339 flow [2025-01-09 21:41:01,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 123 transitions, 318 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,502 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 284 flow [2025-01-09 21:41:01,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2025-01-09 21:41:01,502 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2025-01-09 21:41:01,502 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 284 flow [2025-01-09 21:41:01,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 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-01-09 21:41:01,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,503 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] [2025-01-09 21:41:01,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:41:01,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1246559049, now seen corresponding path program 1 times [2025-01-09 21:41:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-01-09 21:41:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:01,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:01,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-01-09 21:41:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013887822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181163186] [2025-01-09 21:41:01,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 288 [2025-01-09 21:41:01,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-09 21:41:01,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 288 [2025-01-09 21:41:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,579 INFO L124 PetriNetUnfolderBase]: 8/333 cut-off events. [2025-01-09 21:41:01,579 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:41:01,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 333 events. 8/333 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 648 event pairs, 0 based on Foata normal form. 7/325 useless extension candidates. Maximal degree in co-relation 386. Up to 40 conditions per place. [2025-01-09 21:41:01,580 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 14 selfloop transitions, 1 changer transitions 24/117 dead transitions. [2025-01-09 21:41:01,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 117 transitions, 308 flow [2025-01-09 21:41:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2025-01-09 21:41:01,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8067129629629629 [2025-01-09 21:41:01,581 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 284 flow. Second operand 3 states and 697 transitions. [2025-01-09 21:41:01,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 117 transitions, 308 flow [2025-01-09 21:41:01,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:01,583 INFO L231 Difference]: Finished difference. Result has 132 places, 93 transitions, 222 flow [2025-01-09 21:41:01,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=132, PETRI_TRANSITIONS=93} [2025-01-09 21:41:01,584 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -6 predicate places. [2025-01-09 21:41:01,584 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 93 transitions, 222 flow [2025-01-09 21:41:01,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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-01-09 21:41:01,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,585 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:41:01,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1792234219, now seen corresponding path program 1 times [2025-01-09 21:41:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-01-09 21:41:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:41:01,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:41:01,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683914700] [2025-01-09 21:41:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683914700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055259319] [2025-01-09 21:41:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:01,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:01,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 288 [2025-01-09 21:41:01,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 93 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 246.2) internal successors, (1231), 5 states have internal predecessors, (1231), 0 states have call successors, (0), 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-01-09 21:41:01,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 288 [2025-01-09 21:41:01,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,751 INFO L124 PetriNetUnfolderBase]: 0/178 cut-off events. [2025-01-09 21:41:01,751 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:41:01,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 178 events. 0/178 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 100 event pairs, 0 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 0. Up to 26 conditions per place. [2025-01-09 21:41:01,752 INFO L140 encePairwiseOnDemand]: 283/288 looper letters, 14 selfloop transitions, 2 changer transitions 3/95 dead transitions. [2025-01-09 21:41:01,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 95 transitions, 264 flow [2025-01-09 21:41:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1235 transitions. [2025-01-09 21:41:01,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8576388888888888 [2025-01-09 21:41:01,754 INFO L175 Difference]: Start difference. First operand has 132 places, 93 transitions, 222 flow. Second operand 5 states and 1235 transitions. [2025-01-09 21:41:01,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 95 transitions, 264 flow [2025-01-09 21:41:01,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 95 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,755 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 227 flow [2025-01-09 21:41:01,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2025-01-09 21:41:01,755 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -26 predicate places. [2025-01-09 21:41:01,755 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 227 flow [2025-01-09 21:41:01,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 246.2) internal successors, (1231), 5 states have internal predecessors, (1231), 0 states have call successors, (0), 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-01-09 21:41:01,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,756 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:01,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:41:01,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:41:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -785931506, now seen corresponding path program 1 times [2025-01-09 21:41:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314853373] [2025-01-09 21:41:01,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:41:01,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:41:01,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:01,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:41:01,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:41:01,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:01,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:01,790 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:01,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:41:01,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:41:01,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:41:01,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:41:01,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:41:01,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:41:01,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:01,791 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:01,791 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-09 21:41:01,836 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:01,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 324 transitions, 788 flow [2025-01-09 21:41:01,876 INFO L124 PetriNetUnfolderBase]: 34/535 cut-off events. [2025-01-09 21:41:01,876 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-09 21:41:01,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 535 events. 34/535 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1408 event pairs, 0 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 586. Up to 16 conditions per place. [2025-01-09 21:41:01,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 330 places, 324 transitions, 788 flow [2025-01-09 21:41:01,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 133 transitions, 339 flow [2025-01-09 21:41:01,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:01,879 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:01,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:41:01,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:01,880 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:01,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:01,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:01,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:01,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash -424281917, now seen corresponding path program 1 times [2025-01-09 21:41:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-01-09 21:41:01,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:01,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:01,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-01-09 21:41:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253013173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850821825] [2025-01-09 21:41:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:01,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 324 [2025-01-09 21:41:01,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-01-09 21:41:01,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:01,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 324 [2025-01-09 21:41:01,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:01,970 INFO L124 PetriNetUnfolderBase]: 17/421 cut-off events. [2025-01-09 21:41:01,970 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-09 21:41:01,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 421 events. 17/421 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1024 event pairs, 8 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 468. Up to 62 conditions per place. [2025-01-09 21:41:01,971 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 17 selfloop transitions, 2 changer transitions 1/130 dead transitions. [2025-01-09 21:41:01,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 371 flow [2025-01-09 21:41:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-01-09 21:41:01,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.852880658436214 [2025-01-09 21:41:01,973 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 339 flow. Second operand 3 states and 829 transitions. [2025-01-09 21:41:01,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 371 flow [2025-01-09 21:41:01,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 130 transitions, 340 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:01,975 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 304 flow [2025-01-09 21:41:01,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2025-01-09 21:41:01,975 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-01-09 21:41:01,975 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 304 flow [2025-01-09 21:41:01,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 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-01-09 21:41:01,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:01,975 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] [2025-01-09 21:41:01,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:41:01,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:01,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 952168521, now seen corresponding path program 1 times [2025-01-09 21:41:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-01-09 21:41:01,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:01,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:01,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:01,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:01,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-01-09 21:41:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085792694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:01,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:01,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014176044] [2025-01-09 21:41:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:01,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:01,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 324 [2025-01-09 21:41:02,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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-01-09 21:41:02,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 324 [2025-01-09 21:41:02,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,052 INFO L124 PetriNetUnfolderBase]: 9/377 cut-off events. [2025-01-09 21:41:02,052 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:41:02,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 377 events. 9/377 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 749 event pairs, 0 based on Foata normal form. 8/368 useless extension candidates. Maximal degree in co-relation 440. Up to 45 conditions per place. [2025-01-09 21:41:02,053 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 15 selfloop transitions, 1 changer transitions 24/124 dead transitions. [2025-01-09 21:41:02,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 124 transitions, 330 flow [2025-01-09 21:41:02,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2025-01-09 21:41:02,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8045267489711934 [2025-01-09 21:41:02,055 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 304 flow. Second operand 3 states and 782 transitions. [2025-01-09 21:41:02,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 124 transitions, 330 flow [2025-01-09 21:41:02,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 124 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:02,056 INFO L231 Difference]: Finished difference. Result has 141 places, 100 transitions, 242 flow [2025-01-09 21:41:02,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=141, PETRI_TRANSITIONS=100} [2025-01-09 21:41:02,057 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -6 predicate places. [2025-01-09 21:41:02,057 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 100 transitions, 242 flow [2025-01-09 21:41:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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-01-09 21:41:02,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,057 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:41:02,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash -340326098, now seen corresponding path program 1 times [2025-01-09 21:41:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-01-09 21:41:02,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:41:02,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:41:02,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:02,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316769066] [2025-01-09 21:41:02,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316769066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619833899] [2025-01-09 21:41:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:02,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:02,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 324 [2025-01-09 21:41:02,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 100 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 277.4) internal successors, (1387), 5 states have internal predecessors, (1387), 0 states have call successors, (0), 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-01-09 21:41:02,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 324 [2025-01-09 21:41:02,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,225 INFO L124 PetriNetUnfolderBase]: 0/198 cut-off events. [2025-01-09 21:41:02,225 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:41:02,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 198 events. 0/198 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 111 event pairs, 0 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 0. Up to 29 conditions per place. [2025-01-09 21:41:02,226 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 15 selfloop transitions, 2 changer transitions 3/102 dead transitions. [2025-01-09 21:41:02,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 102 transitions, 286 flow [2025-01-09 21:41:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1391 transitions. [2025-01-09 21:41:02,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.858641975308642 [2025-01-09 21:41:02,228 INFO L175 Difference]: Start difference. First operand has 141 places, 100 transitions, 242 flow. Second operand 5 states and 1391 transitions. [2025-01-09 21:41:02,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 102 transitions, 286 flow [2025-01-09 21:41:02,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,229 INFO L231 Difference]: Finished difference. Result has 121 places, 99 transitions, 247 flow [2025-01-09 21:41:02,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=121, PETRI_TRANSITIONS=99} [2025-01-09 21:41:02,232 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -26 predicate places. [2025-01-09 21:41:02,233 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 99 transitions, 247 flow [2025-01-09 21:41:02,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 277.4) internal successors, (1387), 5 states have internal predecessors, (1387), 0 states have call successors, (0), 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-01-09 21:41:02,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,233 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:41:02,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:41:02,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1047276339, now seen corresponding path program 1 times [2025-01-09 21:41:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570873185] [2025-01-09 21:41:02,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:41:02,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:41:02,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:02,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:41:02,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:41:02,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:02,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-09 21:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:41:02,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:41:02,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:41:02,262 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:02,262 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:02,262 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-01-09 21:41:02,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:02,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 360 transitions, 896 flow [2025-01-09 21:41:02,339 INFO L124 PetriNetUnfolderBase]: 38/598 cut-off events. [2025-01-09 21:41:02,340 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:41:02,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 598 events. 38/598 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1594 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 660. Up to 18 conditions per place. [2025-01-09 21:41:02,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 360 transitions, 896 flow [2025-01-09 21:41:02,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 140 transitions, 371 flow [2025-01-09 21:41:02,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:02,343 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:02,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:41:02,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:02,343 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:02,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:02,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1364434749, now seen corresponding path program 1 times [2025-01-09 21:41:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-01-09 21:41:02,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528047602] [2025-01-09 21:41:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528047602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648615193] [2025-01-09 21:41:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 360 [2025-01-09 21:41:02,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 140 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 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-01-09 21:41:02,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 360 [2025-01-09 21:41:02,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,448 INFO L124 PetriNetUnfolderBase]: 19/470 cut-off events. [2025-01-09 21:41:02,448 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-01-09 21:41:02,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 470 events. 19/470 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1119 event pairs, 9 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 534. Up to 69 conditions per place. [2025-01-09 21:41:02,450 INFO L140 encePairwiseOnDemand]: 355/360 looper letters, 18 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-01-09 21:41:02,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 137 transitions, 405 flow [2025-01-09 21:41:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2025-01-09 21:41:02,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2025-01-09 21:41:02,451 INFO L175 Difference]: Start difference. First operand has 156 places, 140 transitions, 371 flow. Second operand 3 states and 920 transitions. [2025-01-09 21:41:02,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 137 transitions, 405 flow [2025-01-09 21:41:02,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 137 transitions, 362 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,453 INFO L231 Difference]: Finished difference. Result has 156 places, 136 transitions, 324 flow [2025-01-09 21:41:02,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=156, PETRI_TRANSITIONS=136} [2025-01-09 21:41:02,454 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 0 predicate places. [2025-01-09 21:41:02,454 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 136 transitions, 324 flow [2025-01-09 21:41:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 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-01-09 21:41:02,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,454 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] [2025-01-09 21:41:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:41:02,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash -806587831, now seen corresponding path program 1 times [2025-01-09 21:41:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550827965] [2025-01-09 21:41:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:02,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:02,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550827965] [2025-01-09 21:41:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550827965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419300998] [2025-01-09 21:41:02,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 360 [2025-01-09 21:41:02,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 136 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 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-01-09 21:41:02,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 360 [2025-01-09 21:41:02,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,557 INFO L124 PetriNetUnfolderBase]: 10/421 cut-off events. [2025-01-09 21:41:02,557 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-01-09 21:41:02,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 421 events. 10/421 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 834 event pairs, 0 based on Foata normal form. 9/411 useless extension candidates. Maximal degree in co-relation 494. Up to 50 conditions per place. [2025-01-09 21:41:02,558 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 16 selfloop transitions, 1 changer transitions 24/131 dead transitions. [2025-01-09 21:41:02,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 131 transitions, 352 flow [2025-01-09 21:41:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-01-09 21:41:02,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027777777777778 [2025-01-09 21:41:02,560 INFO L175 Difference]: Start difference. First operand has 156 places, 136 transitions, 324 flow. Second operand 3 states and 867 transitions. [2025-01-09 21:41:02,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 131 transitions, 352 flow [2025-01-09 21:41:02,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 131 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:02,561 INFO L231 Difference]: Finished difference. Result has 150 places, 107 transitions, 262 flow [2025-01-09 21:41:02,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=150, PETRI_TRANSITIONS=107} [2025-01-09 21:41:02,561 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -6 predicate places. [2025-01-09 21:41:02,561 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 107 transitions, 262 flow [2025-01-09 21:41:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 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-01-09 21:41:02,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,562 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:02,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:41:02,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1482856228, now seen corresponding path program 1 times [2025-01-09 21:41:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809010775] [2025-01-09 21:41:02,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:41:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:41:02,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809010775] [2025-01-09 21:41:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809010775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338862228] [2025-01-09 21:41:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:02,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:02,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 360 [2025-01-09 21:41:02,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 107 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 308.6) internal successors, (1543), 5 states have internal predecessors, (1543), 0 states have call successors, (0), 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-01-09 21:41:02,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 360 [2025-01-09 21:41:02,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,712 INFO L124 PetriNetUnfolderBase]: 0/218 cut-off events. [2025-01-09 21:41:02,712 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-09 21:41:02,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 218 events. 0/218 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 124 event pairs, 0 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 0. Up to 32 conditions per place. [2025-01-09 21:41:02,712 INFO L140 encePairwiseOnDemand]: 355/360 looper letters, 16 selfloop transitions, 2 changer transitions 3/109 dead transitions. [2025-01-09 21:41:02,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 109 transitions, 308 flow [2025-01-09 21:41:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1547 transitions. [2025-01-09 21:41:02,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8594444444444445 [2025-01-09 21:41:02,714 INFO L175 Difference]: Start difference. First operand has 150 places, 107 transitions, 262 flow. Second operand 5 states and 1547 transitions. [2025-01-09 21:41:02,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 109 transitions, 308 flow [2025-01-09 21:41:02,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 109 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,716 INFO L231 Difference]: Finished difference. Result has 130 places, 106 transitions, 267 flow [2025-01-09 21:41:02,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=130, PETRI_TRANSITIONS=106} [2025-01-09 21:41:02,716 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -26 predicate places. [2025-01-09 21:41:02,716 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 106 transitions, 267 flow [2025-01-09 21:41:02,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 308.6) internal successors, (1543), 5 states have internal predecessors, (1543), 0 states have call successors, (0), 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-01-09 21:41:02,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,716 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:41:02,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:41:02,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 787432147, now seen corresponding path program 1 times [2025-01-09 21:41:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74250658] [2025-01-09 21:41:02,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:41:02,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:41:02,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:02,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:41:02,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:41:02,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:02,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:02,748 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-01-09 21:41:02,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-01-09 21:41:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-01-09 21:41:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-01-09 21:41:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-01-09 21:41:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-01-09 21:41:02,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-01-09 21:41:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:41:02,749 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:02,749 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:02,749 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-01-09 21:41:02,794 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 404 places, 396 transitions, 1008 flow [2025-01-09 21:41:02,834 INFO L124 PetriNetUnfolderBase]: 42/661 cut-off events. [2025-01-09 21:41:02,834 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-09 21:41:02,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 661 events. 42/661 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1745 event pairs, 0 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 735. Up to 20 conditions per place. [2025-01-09 21:41:02,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 404 places, 396 transitions, 1008 flow [2025-01-09 21:41:02,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 147 transitions, 405 flow [2025-01-09 21:41:02,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:02,857 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:02,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:41:02,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:02,858 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:02,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:02,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:02,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:02,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1539609405, now seen corresponding path program 1 times [2025-01-09 21:41:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12094459] [2025-01-09 21:41:02,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:02,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:02,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12094459] [2025-01-09 21:41:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12094459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207836] [2025-01-09 21:41:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:02,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:02,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:02,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 396 [2025-01-09 21:41:02,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 147 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 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-01-09 21:41:02,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:02,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 396 [2025-01-09 21:41:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:02,972 INFO L124 PetriNetUnfolderBase]: 21/519 cut-off events. [2025-01-09 21:41:02,972 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-01-09 21:41:02,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 519 events. 21/519 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1262 event pairs, 10 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 601. Up to 76 conditions per place. [2025-01-09 21:41:02,975 INFO L140 encePairwiseOnDemand]: 391/396 looper letters, 19 selfloop transitions, 2 changer transitions 1/144 dead transitions. [2025-01-09 21:41:02,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 144 transitions, 441 flow [2025-01-09 21:41:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2025-01-09 21:41:02,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.851010101010101 [2025-01-09 21:41:02,977 INFO L175 Difference]: Start difference. First operand has 165 places, 147 transitions, 405 flow. Second operand 3 states and 1011 transitions. [2025-01-09 21:41:02,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 144 transitions, 441 flow [2025-01-09 21:41:02,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 144 transitions, 384 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:02,979 INFO L231 Difference]: Finished difference. Result has 165 places, 143 transitions, 344 flow [2025-01-09 21:41:02,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=165, PETRI_TRANSITIONS=143} [2025-01-09 21:41:02,979 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 0 predicate places. [2025-01-09 21:41:02,979 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 143 transitions, 344 flow [2025-01-09 21:41:02,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 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-01-09 21:41:02,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:02,980 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] [2025-01-09 21:41:02,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:41:02,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 265257289, now seen corresponding path program 1 times [2025-01-09 21:41:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-01-09 21:41:02,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:02,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:02,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795075642] [2025-01-09 21:41:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795075642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409978404] [2025-01-09 21:41:03,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:03,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 396 [2025-01-09 21:41:03,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 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-01-09 21:41:03,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 396 [2025-01-09 21:41:03,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,083 INFO L124 PetriNetUnfolderBase]: 11/465 cut-off events. [2025-01-09 21:41:03,084 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:41:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 465 events. 11/465 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 934 event pairs, 0 based on Foata normal form. 10/454 useless extension candidates. Maximal degree in co-relation 548. Up to 55 conditions per place. [2025-01-09 21:41:03,085 INFO L140 encePairwiseOnDemand]: 390/396 looper letters, 17 selfloop transitions, 1 changer transitions 24/138 dead transitions. [2025-01-09 21:41:03,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 138 transitions, 374 flow [2025-01-09 21:41:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-01-09 21:41:03,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8013468013468014 [2025-01-09 21:41:03,087 INFO L175 Difference]: Start difference. First operand has 165 places, 143 transitions, 344 flow. Second operand 3 states and 952 transitions. [2025-01-09 21:41:03,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 138 transitions, 374 flow [2025-01-09 21:41:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 138 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:03,089 INFO L231 Difference]: Finished difference. Result has 159 places, 114 transitions, 282 flow [2025-01-09 21:41:03,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=159, PETRI_TRANSITIONS=114} [2025-01-09 21:41:03,089 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -6 predicate places. [2025-01-09 21:41:03,089 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 114 transitions, 282 flow [2025-01-09 21:41:03,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 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-01-09 21:41:03,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,090 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:41:03,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1642963445, now seen corresponding path program 1 times [2025-01-09 21:41:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-01-09 21:41:03,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:41:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:41:03,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-01-09 21:41:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533687710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218774696] [2025-01-09 21:41:03,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:03,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:03,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 396 [2025-01-09 21:41:03,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 114 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 339.8) internal successors, (1699), 5 states have internal predecessors, (1699), 0 states have call successors, (0), 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-01-09 21:41:03,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 396 [2025-01-09 21:41:03,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,282 INFO L124 PetriNetUnfolderBase]: 0/238 cut-off events. [2025-01-09 21:41:03,282 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-09 21:41:03,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 238 events. 0/238 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 136 event pairs, 0 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 0. Up to 35 conditions per place. [2025-01-09 21:41:03,283 INFO L140 encePairwiseOnDemand]: 391/396 looper letters, 17 selfloop transitions, 2 changer transitions 3/116 dead transitions. [2025-01-09 21:41:03,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 116 transitions, 330 flow [2025-01-09 21:41:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1703 transitions. [2025-01-09 21:41:03,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8601010101010101 [2025-01-09 21:41:03,289 INFO L175 Difference]: Start difference. First operand has 159 places, 114 transitions, 282 flow. Second operand 5 states and 1703 transitions. [2025-01-09 21:41:03,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 116 transitions, 330 flow [2025-01-09 21:41:03,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 116 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:03,291 INFO L231 Difference]: Finished difference. Result has 139 places, 113 transitions, 287 flow [2025-01-09 21:41:03,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=396, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=139, PETRI_TRANSITIONS=113} [2025-01-09 21:41:03,292 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, -26 predicate places. [2025-01-09 21:41:03,292 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 113 transitions, 287 flow [2025-01-09 21:41:03,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 339.8) internal successors, (1699), 5 states have internal predecessors, (1699), 0 states have call successors, (0), 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-01-09 21:41:03,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,292 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:41:03,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-01-09 21:41:03,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash 97077792, now seen corresponding path program 1 times [2025-01-09 21:41:03,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677496617] [2025-01-09 21:41:03,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:41:03,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:41:03,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:03,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:41:03,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:41:03,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:03,342 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-01-09 21:41:03,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-01-09 21:41:03,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:41:03,343 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:03,344 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:03,344 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-01-09 21:41:03,408 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:03,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 441 places, 432 transitions, 1124 flow [2025-01-09 21:41:03,468 INFO L124 PetriNetUnfolderBase]: 46/724 cut-off events. [2025-01-09 21:41:03,469 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-01-09 21:41:03,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 724 events. 46/724 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1968 event pairs, 0 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 811. Up to 22 conditions per place. [2025-01-09 21:41:03,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 441 places, 432 transitions, 1124 flow [2025-01-09 21:41:03,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 154 transitions, 441 flow [2025-01-09 21:41:03,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:03,473 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:03,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-09 21:41:03,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:03,474 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:03,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:03,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:03,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -949805885, now seen corresponding path program 1 times [2025-01-09 21:41:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299741317] [2025-01-09 21:41:03,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:03,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:03,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299741317] [2025-01-09 21:41:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299741317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465125985] [2025-01-09 21:41:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 432 [2025-01-09 21:41:03,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 154 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 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-01-09 21:41:03,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 432 [2025-01-09 21:41:03,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,596 INFO L124 PetriNetUnfolderBase]: 23/568 cut-off events. [2025-01-09 21:41:03,596 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-01-09 21:41:03,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 568 events. 23/568 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1430 event pairs, 11 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 669. Up to 83 conditions per place. [2025-01-09 21:41:03,599 INFO L140 encePairwiseOnDemand]: 427/432 looper letters, 20 selfloop transitions, 2 changer transitions 1/151 dead transitions. [2025-01-09 21:41:03,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 151 transitions, 479 flow [2025-01-09 21:41:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-01-09 21:41:03,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8503086419753086 [2025-01-09 21:41:03,601 INFO L175 Difference]: Start difference. First operand has 174 places, 154 transitions, 441 flow. Second operand 3 states and 1102 transitions. [2025-01-09 21:41:03,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 151 transitions, 479 flow [2025-01-09 21:41:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 151 transitions, 406 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:03,605 INFO L231 Difference]: Finished difference. Result has 174 places, 150 transitions, 364 flow [2025-01-09 21:41:03,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=432, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=174, PETRI_TRANSITIONS=150} [2025-01-09 21:41:03,606 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2025-01-09 21:41:03,606 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 150 transitions, 364 flow [2025-01-09 21:41:03,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 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-01-09 21:41:03,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,609 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] [2025-01-09 21:41:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:41:03,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:03,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash -127263415, now seen corresponding path program 1 times [2025-01-09 21:41:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202581463] [2025-01-09 21:41:03,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:03,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:03,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202581463] [2025-01-09 21:41:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202581463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:03,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924510177] [2025-01-09 21:41:03,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:03,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:03,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 432 [2025-01-09 21:41:03,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 150 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 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-01-09 21:41:03,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 432 [2025-01-09 21:41:03,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,731 INFO L124 PetriNetUnfolderBase]: 12/509 cut-off events. [2025-01-09 21:41:03,731 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-09 21:41:03,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 509 events. 12/509 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1055 event pairs, 0 based on Foata normal form. 11/497 useless extension candidates. Maximal degree in co-relation 602. Up to 60 conditions per place. [2025-01-09 21:41:03,733 INFO L140 encePairwiseOnDemand]: 426/432 looper letters, 18 selfloop transitions, 1 changer transitions 24/145 dead transitions. [2025-01-09 21:41:03,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 145 transitions, 396 flow [2025-01-09 21:41:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2025-01-09 21:41:03,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8001543209876543 [2025-01-09 21:41:03,734 INFO L175 Difference]: Start difference. First operand has 174 places, 150 transitions, 364 flow. Second operand 3 states and 1037 transitions. [2025-01-09 21:41:03,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 145 transitions, 396 flow [2025-01-09 21:41:03,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 145 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:03,736 INFO L231 Difference]: Finished difference. Result has 168 places, 121 transitions, 302 flow [2025-01-09 21:41:03,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=432, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=168, PETRI_TRANSITIONS=121} [2025-01-09 21:41:03,738 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-01-09 21:41:03,738 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 121 transitions, 302 flow [2025-01-09 21:41:03,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 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-01-09 21:41:03,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,739 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:41:03,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:03,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 822310009, now seen corresponding path program 1 times [2025-01-09 21:41:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-01-09 21:41:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:41:03,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:41:03,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:03,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-01-09 21:41:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:03,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807396515] [2025-01-09 21:41:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807396515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:03,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:03,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153447029] [2025-01-09 21:41:03,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:03,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:03,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:03,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:03,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 432 [2025-01-09 21:41:03,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 121 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 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-01-09 21:41:03,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:03,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 432 [2025-01-09 21:41:03,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:03,918 INFO L124 PetriNetUnfolderBase]: 0/258 cut-off events. [2025-01-09 21:41:03,918 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-01-09 21:41:03,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 258 events. 0/258 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 147 event pairs, 0 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 0. Up to 38 conditions per place. [2025-01-09 21:41:03,919 INFO L140 encePairwiseOnDemand]: 427/432 looper letters, 18 selfloop transitions, 2 changer transitions 3/123 dead transitions. [2025-01-09 21:41:03,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 123 transitions, 352 flow [2025-01-09 21:41:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1859 transitions. [2025-01-09 21:41:03,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8606481481481482 [2025-01-09 21:41:03,921 INFO L175 Difference]: Start difference. First operand has 168 places, 121 transitions, 302 flow. Second operand 5 states and 1859 transitions. [2025-01-09 21:41:03,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 123 transitions, 352 flow [2025-01-09 21:41:03,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 123 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:03,923 INFO L231 Difference]: Finished difference. Result has 148 places, 120 transitions, 307 flow [2025-01-09 21:41:03,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=432, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=148, PETRI_TRANSITIONS=120} [2025-01-09 21:41:03,923 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -26 predicate places. [2025-01-09 21:41:03,923 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 120 transitions, 307 flow [2025-01-09 21:41:03,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 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-01-09 21:41:03,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:03,924 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:03,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:41:03,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-01-09 21:41:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1692379212, now seen corresponding path program 1 times [2025-01-09 21:41:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3288627] [2025-01-09 21:41:03,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:41:03,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:41:03,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:41:03,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:41:03,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:03,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:03,959 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:03,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-01-09 21:41:03,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-01-09 21:41:03,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-01-09 21:41:03,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-01-09 21:41:03,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-01-09 21:41:03,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-01-09 21:41:03,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:41:03,960 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:03,961 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:03,961 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-01-09 21:41:04,012 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:04,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 478 places, 468 transitions, 1244 flow [2025-01-09 21:41:04,064 INFO L124 PetriNetUnfolderBase]: 50/787 cut-off events. [2025-01-09 21:41:04,064 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2025-01-09 21:41:04,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 787 events. 50/787 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2184 event pairs, 0 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 888. Up to 24 conditions per place. [2025-01-09 21:41:04,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 478 places, 468 transitions, 1244 flow [2025-01-09 21:41:04,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 161 transitions, 479 flow [2025-01-09 21:41:04,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:04,068 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:04,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-09 21:41:04,069 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:04,069 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:04,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:04,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:04,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:04,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash 404975811, now seen corresponding path program 1 times [2025-01-09 21:41:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954317986] [2025-01-09 21:41:04,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:04,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:04,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:04,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954317986] [2025-01-09 21:41:04,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954317986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553292715] [2025-01-09 21:41:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 468 [2025-01-09 21:41:04,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 161 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 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-01-09 21:41:04,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 468 [2025-01-09 21:41:04,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,203 INFO L124 PetriNetUnfolderBase]: 25/617 cut-off events. [2025-01-09 21:41:04,203 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2025-01-09 21:41:04,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 617 events. 25/617 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1577 event pairs, 12 based on Foata normal form. 1/565 useless extension candidates. Maximal degree in co-relation 738. Up to 90 conditions per place. [2025-01-09 21:41:04,206 INFO L140 encePairwiseOnDemand]: 463/468 looper letters, 21 selfloop transitions, 2 changer transitions 1/158 dead transitions. [2025-01-09 21:41:04,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 158 transitions, 519 flow [2025-01-09 21:41:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1193 transitions. [2025-01-09 21:41:04,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8497150997150997 [2025-01-09 21:41:04,207 INFO L175 Difference]: Start difference. First operand has 183 places, 161 transitions, 479 flow. Second operand 3 states and 1193 transitions. [2025-01-09 21:41:04,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 158 transitions, 519 flow [2025-01-09 21:41:04,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 158 transitions, 428 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,210 INFO L231 Difference]: Finished difference. Result has 183 places, 157 transitions, 384 flow [2025-01-09 21:41:04,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=183, PETRI_TRANSITIONS=157} [2025-01-09 21:41:04,210 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, 0 predicate places. [2025-01-09 21:41:04,210 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 157 transitions, 384 flow [2025-01-09 21:41:04,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 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-01-09 21:41:04,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,211 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] [2025-01-09 21:41:04,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:41:04,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1984149943, now seen corresponding path program 1 times [2025-01-09 21:41:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633492784] [2025-01-09 21:41:04,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633492784] [2025-01-09 21:41:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633492784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252174117] [2025-01-09 21:41:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 468 [2025-01-09 21:41:04,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 157 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-01-09 21:41:04,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 468 [2025-01-09 21:41:04,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,313 INFO L124 PetriNetUnfolderBase]: 13/553 cut-off events. [2025-01-09 21:41:04,313 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-09 21:41:04,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 553 events. 13/553 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1158 event pairs, 0 based on Foata normal form. 12/540 useless extension candidates. Maximal degree in co-relation 656. Up to 65 conditions per place. [2025-01-09 21:41:04,315 INFO L140 encePairwiseOnDemand]: 462/468 looper letters, 19 selfloop transitions, 1 changer transitions 24/152 dead transitions. [2025-01-09 21:41:04,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 152 transitions, 418 flow [2025-01-09 21:41:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2025-01-09 21:41:04,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7991452991452992 [2025-01-09 21:41:04,316 INFO L175 Difference]: Start difference. First operand has 183 places, 157 transitions, 384 flow. Second operand 3 states and 1122 transitions. [2025-01-09 21:41:04,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 152 transitions, 418 flow [2025-01-09 21:41:04,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 152 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:04,318 INFO L231 Difference]: Finished difference. Result has 177 places, 128 transitions, 322 flow [2025-01-09 21:41:04,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=177, PETRI_TRANSITIONS=128} [2025-01-09 21:41:04,319 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, -6 predicate places. [2025-01-09 21:41:04,319 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 128 transitions, 322 flow [2025-01-09 21:41:04,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 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-01-09 21:41:04,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,319 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:04,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:41:04,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:04,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 943665256, now seen corresponding path program 1 times [2025-01-09 21:41:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-01-09 21:41:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:41:04,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:41:04,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-01-09 21:41:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652664571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:04,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606540509] [2025-01-09 21:41:04,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:04,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:04,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:04,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 468 [2025-01-09 21:41:04,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 128 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 402.2) internal successors, (2011), 5 states have internal predecessors, (2011), 0 states have call successors, (0), 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-01-09 21:41:04,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 468 [2025-01-09 21:41:04,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,510 INFO L124 PetriNetUnfolderBase]: 0/278 cut-off events. [2025-01-09 21:41:04,511 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-09 21:41:04,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 278 events. 0/278 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 160 event pairs, 0 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 0. Up to 41 conditions per place. [2025-01-09 21:41:04,511 INFO L140 encePairwiseOnDemand]: 463/468 looper letters, 19 selfloop transitions, 2 changer transitions 3/130 dead transitions. [2025-01-09 21:41:04,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 130 transitions, 374 flow [2025-01-09 21:41:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2015 transitions. [2025-01-09 21:41:04,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2025-01-09 21:41:04,513 INFO L175 Difference]: Start difference. First operand has 177 places, 128 transitions, 322 flow. Second operand 5 states and 2015 transitions. [2025-01-09 21:41:04,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 130 transitions, 374 flow [2025-01-09 21:41:04,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 130 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,515 INFO L231 Difference]: Finished difference. Result has 157 places, 127 transitions, 327 flow [2025-01-09 21:41:04,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=468, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=157, PETRI_TRANSITIONS=127} [2025-01-09 21:41:04,516 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, -26 predicate places. [2025-01-09 21:41:04,516 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 127 transitions, 327 flow [2025-01-09 21:41:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 402.2) internal successors, (2011), 5 states have internal predecessors, (2011), 0 states have call successors, (0), 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-01-09 21:41:04,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,516 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:04,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:41:04,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-01-09 21:41:04,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 701622415, now seen corresponding path program 1 times [2025-01-09 21:41:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444251736] [2025-01-09 21:41:04,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:41:04,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:41:04,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:41:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:41:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:04,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:04,559 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:04,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-01-09 21:41:04,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-01-09 21:41:04,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-01-09 21:41:04,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-01-09 21:41:04,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-01-09 21:41:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 21:41:04,560 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:04,560 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:04,560 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-01-09 21:41:04,614 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:04,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 515 places, 504 transitions, 1368 flow [2025-01-09 21:41:04,671 INFO L124 PetriNetUnfolderBase]: 54/850 cut-off events. [2025-01-09 21:41:04,671 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-01-09 21:41:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 850 events. 54/850 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2324 event pairs, 0 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 966. Up to 26 conditions per place. [2025-01-09 21:41:04,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 515 places, 504 transitions, 1368 flow [2025-01-09 21:41:04,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 168 transitions, 519 flow [2025-01-09 21:41:04,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:04,676 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:04,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:41:04,677 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:04,677 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:04,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:04,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:04,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1770231613, now seen corresponding path program 1 times [2025-01-09 21:41:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-01-09 21:41:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:04,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:04,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148396904] [2025-01-09 21:41:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148396904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391645904] [2025-01-09 21:41:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 504 [2025-01-09 21:41:04,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 168 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 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-01-09 21:41:04,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 504 [2025-01-09 21:41:04,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,813 INFO L124 PetriNetUnfolderBase]: 27/666 cut-off events. [2025-01-09 21:41:04,814 INFO L125 PetriNetUnfolderBase]: For 443/443 co-relation queries the response was YES. [2025-01-09 21:41:04,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 666 events. 27/666 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1717 event pairs, 13 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 808. Up to 97 conditions per place. [2025-01-09 21:41:04,817 INFO L140 encePairwiseOnDemand]: 499/504 looper letters, 22 selfloop transitions, 2 changer transitions 1/165 dead transitions. [2025-01-09 21:41:04,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 165 transitions, 561 flow [2025-01-09 21:41:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-01-09 21:41:04,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2025-01-09 21:41:04,818 INFO L175 Difference]: Start difference. First operand has 192 places, 168 transitions, 519 flow. Second operand 3 states and 1284 transitions. [2025-01-09 21:41:04,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 165 transitions, 561 flow [2025-01-09 21:41:04,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 165 transitions, 450 flow, removed 55 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:04,821 INFO L231 Difference]: Finished difference. Result has 192 places, 164 transitions, 404 flow [2025-01-09 21:41:04,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=192, PETRI_TRANSITIONS=164} [2025-01-09 21:41:04,822 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, 0 predicate places. [2025-01-09 21:41:04,822 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 164 transitions, 404 flow [2025-01-09 21:41:04,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 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-01-09 21:41:04,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,822 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] [2025-01-09 21:41:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 21:41:04,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1010434999, now seen corresponding path program 1 times [2025-01-09 21:41:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303162012] [2025-01-09 21:41:04,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:04,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:04,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:04,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303162012] [2025-01-09 21:41:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303162012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:04,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:04,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:04,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231128129] [2025-01-09 21:41:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:04,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:04,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:04,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:04,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:04,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 504 [2025-01-09 21:41:04,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 164 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 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-01-09 21:41:04,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:04,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 504 [2025-01-09 21:41:04,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:04,979 INFO L124 PetriNetUnfolderBase]: 14/597 cut-off events. [2025-01-09 21:41:04,979 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-09 21:41:04,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 597 events. 14/597 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1272 event pairs, 0 based on Foata normal form. 13/583 useless extension candidates. Maximal degree in co-relation 710. Up to 70 conditions per place. [2025-01-09 21:41:04,982 INFO L140 encePairwiseOnDemand]: 498/504 looper letters, 20 selfloop transitions, 1 changer transitions 24/159 dead transitions. [2025-01-09 21:41:04,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 159 transitions, 440 flow [2025-01-09 21:41:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2025-01-09 21:41:04,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7982804232804233 [2025-01-09 21:41:04,984 INFO L175 Difference]: Start difference. First operand has 192 places, 164 transitions, 404 flow. Second operand 3 states and 1207 transitions. [2025-01-09 21:41:04,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 159 transitions, 440 flow [2025-01-09 21:41:04,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 159 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:04,986 INFO L231 Difference]: Finished difference. Result has 186 places, 135 transitions, 342 flow [2025-01-09 21:41:04,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=186, PETRI_TRANSITIONS=135} [2025-01-09 21:41:04,986 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -6 predicate places. [2025-01-09 21:41:04,987 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 135 transitions, 342 flow [2025-01-09 21:41:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 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-01-09 21:41:04,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:04,987 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:04,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 21:41:04,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2095729214, now seen corresponding path program 1 times [2025-01-09 21:41:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-01-09 21:41:04,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 21:41:05,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 21:41:05,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-01-09 21:41:05,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117787064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836217054] [2025-01-09 21:41:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:05,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:05,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 504 [2025-01-09 21:41:05,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 135 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 433.4) internal successors, (2167), 5 states have internal predecessors, (2167), 0 states have call successors, (0), 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-01-09 21:41:05,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 504 [2025-01-09 21:41:05,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,214 INFO L124 PetriNetUnfolderBase]: 0/298 cut-off events. [2025-01-09 21:41:05,214 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-01-09 21:41:05,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 298 events. 0/298 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 171 event pairs, 0 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 0. Up to 44 conditions per place. [2025-01-09 21:41:05,215 INFO L140 encePairwiseOnDemand]: 499/504 looper letters, 20 selfloop transitions, 2 changer transitions 3/137 dead transitions. [2025-01-09 21:41:05,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 137 transitions, 396 flow [2025-01-09 21:41:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2171 transitions. [2025-01-09 21:41:05,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615079365079366 [2025-01-09 21:41:05,218 INFO L175 Difference]: Start difference. First operand has 186 places, 135 transitions, 342 flow. Second operand 5 states and 2171 transitions. [2025-01-09 21:41:05,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 137 transitions, 396 flow [2025-01-09 21:41:05,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 137 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:05,220 INFO L231 Difference]: Finished difference. Result has 166 places, 134 transitions, 347 flow [2025-01-09 21:41:05,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=504, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=166, PETRI_TRANSITIONS=134} [2025-01-09 21:41:05,220 INFO L279 CegarLoopForPetriNet]: 192 programPoint places, -26 predicate places. [2025-01-09 21:41:05,220 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 134 transitions, 347 flow [2025-01-09 21:41:05,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 433.4) internal successors, (2167), 5 states have internal predecessors, (2167), 0 states have call successors, (0), 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-01-09 21:41:05,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,221 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 21:41:05,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:41:05,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -720729679, now seen corresponding path program 1 times [2025-01-09 21:41:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667497555] [2025-01-09 21:41:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:41:05,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:41:05,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:41:05,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:41:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:05,270 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:05,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-01-09 21:41:05,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-01-09 21:41:05,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-01-09 21:41:05,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-01-09 21:41:05,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-01-09 21:41:05,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-01-09 21:41:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 21:41:05,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:05,272 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:05,272 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-01-09 21:41:05,328 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:05,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 552 places, 540 transitions, 1496 flow [2025-01-09 21:41:05,391 INFO L124 PetriNetUnfolderBase]: 58/913 cut-off events. [2025-01-09 21:41:05,391 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2025-01-09 21:41:05,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 913 events. 58/913 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2581 event pairs, 0 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 1045. Up to 28 conditions per place. [2025-01-09 21:41:05,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 552 places, 540 transitions, 1496 flow [2025-01-09 21:41:05,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 175 transitions, 561 flow [2025-01-09 21:41:05,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:05,397 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:05,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:41:05,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:05,398 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:05,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:05,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:05,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:05,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1114506435, now seen corresponding path program 1 times [2025-01-09 21:41:05,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207176536] [2025-01-09 21:41:05,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:05,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:05,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207176536] [2025-01-09 21:41:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207176536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433217182] [2025-01-09 21:41:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:05,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 540 [2025-01-09 21:41:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 175 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 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-01-09 21:41:05,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 540 [2025-01-09 21:41:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,568 INFO L124 PetriNetUnfolderBase]: 29/715 cut-off events. [2025-01-09 21:41:05,568 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-01-09 21:41:05,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 715 events. 29/715 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1789 event pairs, 14 based on Foata normal form. 1/655 useless extension candidates. Maximal degree in co-relation 879. Up to 104 conditions per place. [2025-01-09 21:41:05,572 INFO L140 encePairwiseOnDemand]: 535/540 looper letters, 23 selfloop transitions, 2 changer transitions 1/172 dead transitions. [2025-01-09 21:41:05,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 172 transitions, 605 flow [2025-01-09 21:41:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-01-09 21:41:05,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487654320987654 [2025-01-09 21:41:05,574 INFO L175 Difference]: Start difference. First operand has 201 places, 175 transitions, 561 flow. Second operand 3 states and 1375 transitions. [2025-01-09 21:41:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 172 transitions, 605 flow [2025-01-09 21:41:05,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 172 transitions, 472 flow, removed 66 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:05,576 INFO L231 Difference]: Finished difference. Result has 201 places, 171 transitions, 424 flow [2025-01-09 21:41:05,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=540, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=201, PETRI_TRANSITIONS=171} [2025-01-09 21:41:05,577 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, 0 predicate places. [2025-01-09 21:41:05,577 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 171 transitions, 424 flow [2025-01-09 21:41:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 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-01-09 21:41:05,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,577 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] [2025-01-09 21:41:05,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 21:41:05,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1501085879, now seen corresponding path program 1 times [2025-01-09 21:41:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-01-09 21:41:05,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:05,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-01-09 21:41:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139595065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470919315] [2025-01-09 21:41:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:05,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:05,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 540 [2025-01-09 21:41:05,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 171 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 0 states have call successors, (0), 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-01-09 21:41:05,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 540 [2025-01-09 21:41:05,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,699 INFO L124 PetriNetUnfolderBase]: 15/641 cut-off events. [2025-01-09 21:41:05,699 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-01-09 21:41:05,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 641 events. 15/641 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1320 event pairs, 0 based on Foata normal form. 14/626 useless extension candidates. Maximal degree in co-relation 764. Up to 75 conditions per place. [2025-01-09 21:41:05,702 INFO L140 encePairwiseOnDemand]: 534/540 looper letters, 21 selfloop transitions, 1 changer transitions 24/166 dead transitions. [2025-01-09 21:41:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 166 transitions, 462 flow [2025-01-09 21:41:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1292 transitions. [2025-01-09 21:41:05,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975308641975308 [2025-01-09 21:41:05,704 INFO L175 Difference]: Start difference. First operand has 201 places, 171 transitions, 424 flow. Second operand 3 states and 1292 transitions. [2025-01-09 21:41:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 166 transitions, 462 flow [2025-01-09 21:41:05,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 166 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:05,706 INFO L231 Difference]: Finished difference. Result has 195 places, 142 transitions, 362 flow [2025-01-09 21:41:05,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=540, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=195, PETRI_TRANSITIONS=142} [2025-01-09 21:41:05,706 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -6 predicate places. [2025-01-09 21:41:05,706 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 142 transitions, 362 flow [2025-01-09 21:41:05,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.0) internal successors, (1266), 3 states have internal predecessors, (1266), 0 states have call successors, (0), 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-01-09 21:41:05,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,707 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:05,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 21:41:05,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 18904199, now seen corresponding path program 1 times [2025-01-09 21:41:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649447236] [2025-01-09 21:41:05,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:41:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:41:05,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:05,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649447236] [2025-01-09 21:41:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649447236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:05,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:05,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676164234] [2025-01-09 21:41:05,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:05,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:05,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:05,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:05,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 540 [2025-01-09 21:41:05,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 142 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 464.6) internal successors, (2323), 5 states have internal predecessors, (2323), 0 states have call successors, (0), 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-01-09 21:41:05,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:05,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 540 [2025-01-09 21:41:05,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:05,898 INFO L124 PetriNetUnfolderBase]: 0/318 cut-off events. [2025-01-09 21:41:05,898 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-01-09 21:41:05,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 318 events. 0/318 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 184 event pairs, 0 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 0. Up to 47 conditions per place. [2025-01-09 21:41:05,898 INFO L140 encePairwiseOnDemand]: 535/540 looper letters, 21 selfloop transitions, 2 changer transitions 3/144 dead transitions. [2025-01-09 21:41:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 144 transitions, 418 flow [2025-01-09 21:41:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2327 transitions. [2025-01-09 21:41:05,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8618518518518519 [2025-01-09 21:41:05,901 INFO L175 Difference]: Start difference. First operand has 195 places, 142 transitions, 362 flow. Second operand 5 states and 2327 transitions. [2025-01-09 21:41:05,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 144 transitions, 418 flow [2025-01-09 21:41:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 144 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:05,902 INFO L231 Difference]: Finished difference. Result has 175 places, 141 transitions, 367 flow [2025-01-09 21:41:05,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=540, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=175, PETRI_TRANSITIONS=141} [2025-01-09 21:41:05,903 INFO L279 CegarLoopForPetriNet]: 201 programPoint places, -26 predicate places. [2025-01-09 21:41:05,903 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 141 transitions, 367 flow [2025-01-09 21:41:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 464.6) internal successors, (2323), 5 states have internal predecessors, (2323), 0 states have call successors, (0), 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-01-09 21:41:05,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:05,904 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:05,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 21:41:05,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:41:05,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash 800446490, now seen corresponding path program 1 times [2025-01-09 21:41:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142527] [2025-01-09 21:41:05,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:05,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 21:41:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 21:41:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:05,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 21:41:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 21:41:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:05,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:05,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:41:05,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:41:05,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:41:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 21:41:05,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:05,948 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:05,948 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-01-09 21:41:06,009 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:06,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 589 places, 576 transitions, 1628 flow [2025-01-09 21:41:06,102 INFO L124 PetriNetUnfolderBase]: 62/976 cut-off events. [2025-01-09 21:41:06,102 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2025-01-09 21:41:06,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 976 events. 62/976 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2756 event pairs, 0 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1125. Up to 30 conditions per place. [2025-01-09 21:41:06,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 589 places, 576 transitions, 1628 flow [2025-01-09 21:41:06,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 182 transitions, 605 flow [2025-01-09 21:41:06,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:06,109 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:06,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-09 21:41:06,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:06,110 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:06,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:06,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:06,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 469255363, now seen corresponding path program 1 times [2025-01-09 21:41:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-01-09 21:41:06,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832595843] [2025-01-09 21:41:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832595843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697784436] [2025-01-09 21:41:06,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:06,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:06,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 576 [2025-01-09 21:41:06,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 182 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-01-09 21:41:06,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 576 [2025-01-09 21:41:06,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:06,258 INFO L124 PetriNetUnfolderBase]: 31/764 cut-off events. [2025-01-09 21:41:06,258 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-01-09 21:41:06,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 764 events. 31/764 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1986 event pairs, 15 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 951. Up to 111 conditions per place. [2025-01-09 21:41:06,261 INFO L140 encePairwiseOnDemand]: 571/576 looper letters, 24 selfloop transitions, 2 changer transitions 1/179 dead transitions. [2025-01-09 21:41:06,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 179 transitions, 651 flow [2025-01-09 21:41:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1466 transitions. [2025-01-09 21:41:06,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8483796296296297 [2025-01-09 21:41:06,262 INFO L175 Difference]: Start difference. First operand has 210 places, 182 transitions, 605 flow. Second operand 3 states and 1466 transitions. [2025-01-09 21:41:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 179 transitions, 651 flow [2025-01-09 21:41:06,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 179 transitions, 494 flow, removed 78 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:06,265 INFO L231 Difference]: Finished difference. Result has 210 places, 178 transitions, 444 flow [2025-01-09 21:41:06,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=210, PETRI_TRANSITIONS=178} [2025-01-09 21:41:06,265 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 0 predicate places. [2025-01-09 21:41:06,265 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 178 transitions, 444 flow [2025-01-09 21:41:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 0 states have call successors, (0), 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-01-09 21:41:06,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,266 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] [2025-01-09 21:41:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 21:41:06,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:06,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 838864713, now seen corresponding path program 1 times [2025-01-09 21:41:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-01-09 21:41:06,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:06,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:06,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-01-09 21:41:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734157462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487548] [2025-01-09 21:41:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:06,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 576 [2025-01-09 21:41:06,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 178 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 0 states have call successors, (0), 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-01-09 21:41:06,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 576 [2025-01-09 21:41:06,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:06,388 INFO L124 PetriNetUnfolderBase]: 16/685 cut-off events. [2025-01-09 21:41:06,388 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-01-09 21:41:06,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 685 events. 16/685 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1465 event pairs, 0 based on Foata normal form. 15/669 useless extension candidates. Maximal degree in co-relation 818. Up to 80 conditions per place. [2025-01-09 21:41:06,391 INFO L140 encePairwiseOnDemand]: 570/576 looper letters, 22 selfloop transitions, 1 changer transitions 24/173 dead transitions. [2025-01-09 21:41:06,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 173 transitions, 484 flow [2025-01-09 21:41:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1377 transitions. [2025-01-09 21:41:06,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796875 [2025-01-09 21:41:06,392 INFO L175 Difference]: Start difference. First operand has 210 places, 178 transitions, 444 flow. Second operand 3 states and 1377 transitions. [2025-01-09 21:41:06,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 173 transitions, 484 flow [2025-01-09 21:41:06,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:06,394 INFO L231 Difference]: Finished difference. Result has 204 places, 149 transitions, 382 flow [2025-01-09 21:41:06,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=204, PETRI_TRANSITIONS=149} [2025-01-09 21:41:06,394 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -6 predicate places. [2025-01-09 21:41:06,394 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 149 transitions, 382 flow [2025-01-09 21:41:06,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 0 states have call successors, (0), 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-01-09 21:41:06,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,394 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 21:41:06,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1557304137, now seen corresponding path program 1 times [2025-01-09 21:41:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497643183] [2025-01-09 21:41:06,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-09 21:41:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-09 21:41:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497643183] [2025-01-09 21:41:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497643183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511540762] [2025-01-09 21:41:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:06,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:06,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 576 [2025-01-09 21:41:06,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 149 transitions, 382 flow. Second operand has 5 states, 5 states have (on average 495.8) internal successors, (2479), 5 states have internal predecessors, (2479), 0 states have call successors, (0), 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-01-09 21:41:06,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 576 [2025-01-09 21:41:06,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:06,602 INFO L124 PetriNetUnfolderBase]: 0/338 cut-off events. [2025-01-09 21:41:06,602 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-01-09 21:41:06,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 338 events. 0/338 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 195 event pairs, 0 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 0. Up to 50 conditions per place. [2025-01-09 21:41:06,602 INFO L140 encePairwiseOnDemand]: 571/576 looper letters, 22 selfloop transitions, 2 changer transitions 3/151 dead transitions. [2025-01-09 21:41:06,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 151 transitions, 440 flow [2025-01-09 21:41:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2483 transitions. [2025-01-09 21:41:06,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621527777777778 [2025-01-09 21:41:06,604 INFO L175 Difference]: Start difference. First operand has 204 places, 149 transitions, 382 flow. Second operand 5 states and 2483 transitions. [2025-01-09 21:41:06,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 151 transitions, 440 flow [2025-01-09 21:41:06,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 151 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:06,605 INFO L231 Difference]: Finished difference. Result has 184 places, 148 transitions, 387 flow [2025-01-09 21:41:06,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=576, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=184, PETRI_TRANSITIONS=148} [2025-01-09 21:41:06,606 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -26 predicate places. [2025-01-09 21:41:06,606 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 148 transitions, 387 flow [2025-01-09 21:41:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 495.8) internal successors, (2479), 5 states have internal predecessors, (2479), 0 states have call successors, (0), 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-01-09 21:41:06,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,606 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:06,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 21:41:06,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:41:06,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1223590090, now seen corresponding path program 1 times [2025-01-09 21:41:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403857870] [2025-01-09 21:41:06,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 21:41:06,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 21:41:06,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:06,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:06,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 21:41:06,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 21:41:06,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:06,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:06,660 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:06,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-01-09 21:41:06,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-01-09 21:41:06,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-01-09 21:41:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 21:41:06,662 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:06,662 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:06,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-01-09 21:41:06,758 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:06,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 626 places, 612 transitions, 1764 flow [2025-01-09 21:41:06,834 INFO L124 PetriNetUnfolderBase]: 66/1039 cut-off events. [2025-01-09 21:41:06,834 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2025-01-09 21:41:06,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1039 events. 66/1039 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2895 event pairs, 0 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1206. Up to 32 conditions per place. [2025-01-09 21:41:06,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 626 places, 612 transitions, 1764 flow [2025-01-09 21:41:06,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 189 transitions, 651 flow [2025-01-09 21:41:06,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:06,843 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:06,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:41:06,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:06,844 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:06,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:06,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:06,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:06,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:06,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash 588982467, now seen corresponding path program 1 times [2025-01-09 21:41:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715133459] [2025-01-09 21:41:06,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:06,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:06,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:06,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:06,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715133459] [2025-01-09 21:41:06,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715133459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:06,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437665250] [2025-01-09 21:41:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:06,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:06,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:06,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:06,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 612 [2025-01-09 21:41:06,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 189 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-01-09 21:41:06,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:06,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 612 [2025-01-09 21:41:06,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,063 INFO L124 PetriNetUnfolderBase]: 33/813 cut-off events. [2025-01-09 21:41:07,064 INFO L125 PetriNetUnfolderBase]: For 801/801 co-relation queries the response was YES. [2025-01-09 21:41:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 813 events. 33/813 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2135 event pairs, 16 based on Foata normal form. 1/745 useless extension candidates. Maximal degree in co-relation 1024. Up to 118 conditions per place. [2025-01-09 21:41:07,067 INFO L140 encePairwiseOnDemand]: 607/612 looper letters, 25 selfloop transitions, 2 changer transitions 1/186 dead transitions. [2025-01-09 21:41:07,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 186 transitions, 699 flow [2025-01-09 21:41:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1557 transitions. [2025-01-09 21:41:07,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8480392156862745 [2025-01-09 21:41:07,068 INFO L175 Difference]: Start difference. First operand has 219 places, 189 transitions, 651 flow. Second operand 3 states and 1557 transitions. [2025-01-09 21:41:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 186 transitions, 699 flow [2025-01-09 21:41:07,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 186 transitions, 516 flow, removed 91 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,072 INFO L231 Difference]: Finished difference. Result has 219 places, 185 transitions, 464 flow [2025-01-09 21:41:07,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=219, PETRI_TRANSITIONS=185} [2025-01-09 21:41:07,073 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, 0 predicate places. [2025-01-09 21:41:07,073 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 185 transitions, 464 flow [2025-01-09 21:41:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-01-09 21:41:07,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,074 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] [2025-01-09 21:41:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 21:41:07,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1714449481, now seen corresponding path program 1 times [2025-01-09 21:41:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-01-09 21:41:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:07,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:07,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-01-09 21:41:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207864207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-01-09 21:41:07,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:07,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 612 [2025-01-09 21:41:07,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 185 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 478.0) internal successors, (1434), 3 states have internal predecessors, (1434), 0 states have call successors, (0), 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-01-09 21:41:07,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 612 [2025-01-09 21:41:07,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,251 INFO L124 PetriNetUnfolderBase]: 17/729 cut-off events. [2025-01-09 21:41:07,252 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-09 21:41:07,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 729 events. 17/729 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1582 event pairs, 0 based on Foata normal form. 16/712 useless extension candidates. Maximal degree in co-relation 872. Up to 85 conditions per place. [2025-01-09 21:41:07,256 INFO L140 encePairwiseOnDemand]: 606/612 looper letters, 23 selfloop transitions, 1 changer transitions 24/180 dead transitions. [2025-01-09 21:41:07,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 180 transitions, 506 flow [2025-01-09 21:41:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-01-09 21:41:07,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2025-01-09 21:41:07,258 INFO L175 Difference]: Start difference. First operand has 219 places, 185 transitions, 464 flow. Second operand 3 states and 1462 transitions. [2025-01-09 21:41:07,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 180 transitions, 506 flow [2025-01-09 21:41:07,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 180 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:07,260 INFO L231 Difference]: Finished difference. Result has 213 places, 156 transitions, 402 flow [2025-01-09 21:41:07,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=213, PETRI_TRANSITIONS=156} [2025-01-09 21:41:07,261 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places. [2025-01-09 21:41:07,261 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 156 transitions, 402 flow [2025-01-09 21:41:07,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 478.0) internal successors, (1434), 3 states have internal predecessors, (1434), 0 states have call successors, (0), 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-01-09 21:41:07,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,262 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:07,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-09 21:41:07,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:07,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1722864046, now seen corresponding path program 1 times [2025-01-09 21:41:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-01-09 21:41:07,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-09 21:41:07,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-09 21:41:07,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-01-09 21:41:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612887889] [2025-01-09 21:41:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:07,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:07,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 522 out of 612 [2025-01-09 21:41:07,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 156 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 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-01-09 21:41:07,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 522 of 612 [2025-01-09 21:41:07,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,506 INFO L124 PetriNetUnfolderBase]: 0/358 cut-off events. [2025-01-09 21:41:07,507 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-01-09 21:41:07,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 358 events. 0/358 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 208 event pairs, 0 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 0. Up to 53 conditions per place. [2025-01-09 21:41:07,507 INFO L140 encePairwiseOnDemand]: 607/612 looper letters, 23 selfloop transitions, 2 changer transitions 3/158 dead transitions. [2025-01-09 21:41:07,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 158 transitions, 462 flow [2025-01-09 21:41:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2639 transitions. [2025-01-09 21:41:07,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624183006535948 [2025-01-09 21:41:07,511 INFO L175 Difference]: Start difference. First operand has 213 places, 156 transitions, 402 flow. Second operand 5 states and 2639 transitions. [2025-01-09 21:41:07,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 158 transitions, 462 flow [2025-01-09 21:41:07,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 158 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,513 INFO L231 Difference]: Finished difference. Result has 193 places, 155 transitions, 407 flow [2025-01-09 21:41:07,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=612, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=193, PETRI_TRANSITIONS=155} [2025-01-09 21:41:07,514 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -26 predicate places. [2025-01-09 21:41:07,514 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 155 transitions, 407 flow [2025-01-09 21:41:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 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-01-09 21:41:07,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,515 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:07,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 21:41:07,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:41:07,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1030635713, now seen corresponding path program 1 times [2025-01-09 21:41:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723902272] [2025-01-09 21:41:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 21:41:07,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 21:41:07,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:07,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 21:41:07,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 21:41:07,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:07,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:07,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:07,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:41:07,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:41:07,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:41:07,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:41:07,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:41:07,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:41:07,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 23 remaining) [2025-01-09 21:41:07,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:41:07,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:41:07,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:41:07,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:41:07,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:41:07,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:41:07,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:41:07,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:41:07,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-09 21:41:07,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:07,596 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:07,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-01-09 21:41:07,664 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:07,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 663 places, 648 transitions, 1904 flow [2025-01-09 21:41:07,751 INFO L124 PetriNetUnfolderBase]: 70/1102 cut-off events. [2025-01-09 21:41:07,751 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2025-01-09 21:41:07,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1102 events. 70/1102 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3037 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1288. Up to 34 conditions per place. [2025-01-09 21:41:07,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 663 places, 648 transitions, 1904 flow [2025-01-09 21:41:07,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 196 transitions, 699 flow [2025-01-09 21:41:07,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:07,762 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:07,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-09 21:41:07,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:07,763 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:07,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:07,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:07,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:07,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1473687747, now seen corresponding path program 1 times [2025-01-09 21:41:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-01-09 21:41:07,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:07,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:07,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:07,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312495224] [2025-01-09 21:41:07,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312495224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974949184] [2025-01-09 21:41:07,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:07,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 648 [2025-01-09 21:41:07,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 196 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 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-01-09 21:41:07,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:07,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 648 [2025-01-09 21:41:07,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:07,963 INFO L124 PetriNetUnfolderBase]: 35/862 cut-off events. [2025-01-09 21:41:07,963 INFO L125 PetriNetUnfolderBase]: For 953/953 co-relation queries the response was YES. [2025-01-09 21:41:07,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 862 events. 35/862 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2190 event pairs, 17 based on Foata normal form. 1/790 useless extension candidates. Maximal degree in co-relation 1098. Up to 125 conditions per place. [2025-01-09 21:41:07,968 INFO L140 encePairwiseOnDemand]: 643/648 looper letters, 26 selfloop transitions, 2 changer transitions 1/193 dead transitions. [2025-01-09 21:41:07,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 193 transitions, 749 flow [2025-01-09 21:41:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1648 transitions. [2025-01-09 21:41:07,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8477366255144033 [2025-01-09 21:41:07,969 INFO L175 Difference]: Start difference. First operand has 228 places, 196 transitions, 699 flow. Second operand 3 states and 1648 transitions. [2025-01-09 21:41:07,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 193 transitions, 749 flow [2025-01-09 21:41:07,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 193 transitions, 538 flow, removed 105 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:07,973 INFO L231 Difference]: Finished difference. Result has 228 places, 192 transitions, 484 flow [2025-01-09 21:41:07,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=228, PETRI_TRANSITIONS=192} [2025-01-09 21:41:07,973 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2025-01-09 21:41:07,973 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 192 transitions, 484 flow [2025-01-09 21:41:07,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 0 states have call successors, (0), 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-01-09 21:41:07,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:07,974 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] [2025-01-09 21:41:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-09 21:41:07,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1125668425, now seen corresponding path program 1 times [2025-01-09 21:41:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-01-09 21:41:07,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:07,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:07,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:07,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:07,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468238690] [2025-01-09 21:41:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468238690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288720222] [2025-01-09 21:41:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:07,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:07,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:07,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:08,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 648 [2025-01-09 21:41:08,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 192 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 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-01-09 21:41:08,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 648 [2025-01-09 21:41:08,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,113 INFO L124 PetriNetUnfolderBase]: 18/773 cut-off events. [2025-01-09 21:41:08,113 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-01-09 21:41:08,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 773 events. 18/773 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1634 event pairs, 0 based on Foata normal form. 17/755 useless extension candidates. Maximal degree in co-relation 926. Up to 90 conditions per place. [2025-01-09 21:41:08,116 INFO L140 encePairwiseOnDemand]: 642/648 looper letters, 24 selfloop transitions, 1 changer transitions 24/187 dead transitions. [2025-01-09 21:41:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 187 transitions, 528 flow [2025-01-09 21:41:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-01-09 21:41:08,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7957818930041153 [2025-01-09 21:41:08,118 INFO L175 Difference]: Start difference. First operand has 228 places, 192 transitions, 484 flow. Second operand 3 states and 1547 transitions. [2025-01-09 21:41:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 187 transitions, 528 flow [2025-01-09 21:41:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 187 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:08,120 INFO L231 Difference]: Finished difference. Result has 222 places, 163 transitions, 422 flow [2025-01-09 21:41:08,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=222, PETRI_TRANSITIONS=163} [2025-01-09 21:41:08,120 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -6 predicate places. [2025-01-09 21:41:08,120 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 163 transitions, 422 flow [2025-01-09 21:41:08,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 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-01-09 21:41:08,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,121 INFO L206 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-01-09 21:41:08,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1309877928, now seen corresponding path program 1 times [2025-01-09 21:41:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-01-09 21:41:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 21:41:08,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 21:41:08,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-01-09 21:41:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395695518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:08,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357143043] [2025-01-09 21:41:08,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:08,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:08,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 648 [2025-01-09 21:41:08,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 163 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 558.2) internal successors, (2791), 5 states have internal predecessors, (2791), 0 states have call successors, (0), 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-01-09 21:41:08,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 648 [2025-01-09 21:41:08,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,323 INFO L124 PetriNetUnfolderBase]: 0/378 cut-off events. [2025-01-09 21:41:08,323 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-09 21:41:08,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 378 events. 0/378 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 220 event pairs, 0 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 0. Up to 56 conditions per place. [2025-01-09 21:41:08,324 INFO L140 encePairwiseOnDemand]: 643/648 looper letters, 24 selfloop transitions, 2 changer transitions 3/165 dead transitions. [2025-01-09 21:41:08,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 165 transitions, 484 flow [2025-01-09 21:41:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2795 transitions. [2025-01-09 21:41:08,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8626543209876543 [2025-01-09 21:41:08,325 INFO L175 Difference]: Start difference. First operand has 222 places, 163 transitions, 422 flow. Second operand 5 states and 2795 transitions. [2025-01-09 21:41:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 165 transitions, 484 flow [2025-01-09 21:41:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 165 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:08,328 INFO L231 Difference]: Finished difference. Result has 202 places, 162 transitions, 427 flow [2025-01-09 21:41:08,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=648, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=202, PETRI_TRANSITIONS=162} [2025-01-09 21:41:08,328 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -26 predicate places. [2025-01-09 21:41:08,328 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 162 transitions, 427 flow [2025-01-09 21:41:08,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 558.2) internal successors, (2791), 5 states have internal predecessors, (2791), 0 states have call successors, (0), 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-01-09 21:41:08,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,329 INFO L206 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:08,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-01-09 21:41:08,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-01-09 21:41:08,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1308484863, now seen corresponding path program 1 times [2025-01-09 21:41:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814177830] [2025-01-09 21:41:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 21:41:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 21:41:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:08,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:08,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 21:41:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 21:41:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:08,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:08,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:08,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-01-09 21:41:08,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2025-01-09 21:41:08,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2025-01-09 21:41:08,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-01-09 21:41:08,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-01-09 21:41:08,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-01-09 21:41:08,400 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:08,401 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:08,401 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-01-09 21:41:08,464 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:08,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 700 places, 684 transitions, 2048 flow [2025-01-09 21:41:08,593 INFO L124 PetriNetUnfolderBase]: 74/1165 cut-off events. [2025-01-09 21:41:08,593 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-01-09 21:41:08,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1165 events. 74/1165 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3264 event pairs, 0 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1371. Up to 36 conditions per place. [2025-01-09 21:41:08,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 700 places, 684 transitions, 2048 flow [2025-01-09 21:41:08,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 203 transitions, 749 flow [2025-01-09 21:41:08,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:08,600 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:08,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:41:08,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:08,601 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:08,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:08,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:08,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1171596093, now seen corresponding path program 1 times [2025-01-09 21:41:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806027808] [2025-01-09 21:41:08,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:08,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:08,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806027808] [2025-01-09 21:41:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806027808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603397263] [2025-01-09 21:41:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:08,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:08,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:08,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 569 out of 684 [2025-01-09 21:41:08,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 203 transitions, 749 flow. Second operand has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 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-01-09 21:41:08,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 569 of 684 [2025-01-09 21:41:08,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,766 INFO L124 PetriNetUnfolderBase]: 37/911 cut-off events. [2025-01-09 21:41:08,767 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2025-01-09 21:41:08,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 911 events. 37/911 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2322 event pairs, 18 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 1173. Up to 132 conditions per place. [2025-01-09 21:41:08,774 INFO L140 encePairwiseOnDemand]: 679/684 looper letters, 27 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-01-09 21:41:08,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 200 transitions, 801 flow [2025-01-09 21:41:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1739 transitions. [2025-01-09 21:41:08,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8474658869395711 [2025-01-09 21:41:08,775 INFO L175 Difference]: Start difference. First operand has 237 places, 203 transitions, 749 flow. Second operand 3 states and 1739 transitions. [2025-01-09 21:41:08,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 200 transitions, 801 flow [2025-01-09 21:41:08,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 200 transitions, 560 flow, removed 120 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:08,779 INFO L231 Difference]: Finished difference. Result has 237 places, 199 transitions, 504 flow [2025-01-09 21:41:08,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=684, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=237, PETRI_TRANSITIONS=199} [2025-01-09 21:41:08,779 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, 0 predicate places. [2025-01-09 21:41:08,779 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 199 transitions, 504 flow [2025-01-09 21:41:08,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 570.3333333333334) internal successors, (1711), 3 states have internal predecessors, (1711), 0 states have call successors, (0), 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-01-09 21:41:08,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:08,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-01-09 21:41:08,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -927478455, now seen corresponding path program 1 times [2025-01-09 21:41:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-01-09 21:41:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:08,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-01-09 21:41:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813859726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999530451] [2025-01-09 21:41:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:08,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:08,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:08,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:08,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 533 out of 684 [2025-01-09 21:41:08,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 199 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 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-01-09 21:41:08,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:08,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 533 of 684 [2025-01-09 21:41:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:08,926 INFO L124 PetriNetUnfolderBase]: 19/817 cut-off events. [2025-01-09 21:41:08,926 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-01-09 21:41:08,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 817 events. 19/817 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1733 event pairs, 0 based on Foata normal form. 18/798 useless extension candidates. Maximal degree in co-relation 980. Up to 95 conditions per place. [2025-01-09 21:41:08,931 INFO L140 encePairwiseOnDemand]: 678/684 looper letters, 25 selfloop transitions, 1 changer transitions 24/194 dead transitions. [2025-01-09 21:41:08,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 194 transitions, 550 flow [2025-01-09 21:41:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1632 transitions. [2025-01-09 21:41:08,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953216374269005 [2025-01-09 21:41:08,932 INFO L175 Difference]: Start difference. First operand has 237 places, 199 transitions, 504 flow. Second operand 3 states and 1632 transitions. [2025-01-09 21:41:08,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 194 transitions, 550 flow [2025-01-09 21:41:08,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 194 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:08,934 INFO L231 Difference]: Finished difference. Result has 231 places, 170 transitions, 442 flow [2025-01-09 21:41:08,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=684, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=231, PETRI_TRANSITIONS=170} [2025-01-09 21:41:08,936 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -6 predicate places. [2025-01-09 21:41:08,936 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 170 transitions, 442 flow [2025-01-09 21:41:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 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-01-09 21:41:08,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:08,936 INFO L206 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:08,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-01-09 21:41:08,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -640541239, now seen corresponding path program 1 times [2025-01-09 21:41:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028781802] [2025-01-09 21:41:08,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:08,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 21:41:08,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 21:41:08,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:08,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,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-01-09 21:41:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028781802] [2025-01-09 21:41:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028781802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817575805] [2025-01-09 21:41:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:09,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:09,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 684 [2025-01-09 21:41:09,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 170 transitions, 442 flow. Second operand has 5 states, 5 states have (on average 589.4) internal successors, (2947), 5 states have internal predecessors, (2947), 0 states have call successors, (0), 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-01-09 21:41:09,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 684 [2025-01-09 21:41:09,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,147 INFO L124 PetriNetUnfolderBase]: 0/398 cut-off events. [2025-01-09 21:41:09,147 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-01-09 21:41:09,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 398 events. 0/398 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 231 event pairs, 0 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 0. Up to 59 conditions per place. [2025-01-09 21:41:09,148 INFO L140 encePairwiseOnDemand]: 679/684 looper letters, 25 selfloop transitions, 2 changer transitions 3/172 dead transitions. [2025-01-09 21:41:09,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 172 transitions, 506 flow [2025-01-09 21:41:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2951 transitions. [2025-01-09 21:41:09,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8628654970760234 [2025-01-09 21:41:09,150 INFO L175 Difference]: Start difference. First operand has 231 places, 170 transitions, 442 flow. Second operand 5 states and 2951 transitions. [2025-01-09 21:41:09,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 172 transitions, 506 flow [2025-01-09 21:41:09,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 172 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:09,152 INFO L231 Difference]: Finished difference. Result has 211 places, 169 transitions, 447 flow [2025-01-09 21:41:09,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=684, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=211, PETRI_TRANSITIONS=169} [2025-01-09 21:41:09,153 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -26 predicate places. [2025-01-09 21:41:09,153 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 169 transitions, 447 flow [2025-01-09 21:41:09,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 589.4) internal successors, (2947), 5 states have internal predecessors, (2947), 0 states have call successors, (0), 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-01-09 21:41:09,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,154 INFO L206 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:09,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-01-09 21:41:09,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:41:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2061847172, now seen corresponding path program 1 times [2025-01-09 21:41:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678136079] [2025-01-09 21:41:09,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 21:41:09,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 21:41:09,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:09,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 21:41:09,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 21:41:09,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:09,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:09,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-01-09 21:41:09,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-01-09 21:41:09,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-01-09 21:41:09,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-01-09 21:41:09,267 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:09,267 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:09,267 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-01-09 21:41:09,385 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:09,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 737 places, 720 transitions, 2196 flow [2025-01-09 21:41:09,490 INFO L124 PetriNetUnfolderBase]: 78/1228 cut-off events. [2025-01-09 21:41:09,490 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2025-01-09 21:41:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1228 events. 78/1228 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3556 event pairs, 0 based on Foata normal form. 0/1089 useless extension candidates. Maximal degree in co-relation 1455. Up to 38 conditions per place. [2025-01-09 21:41:09,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 737 places, 720 transitions, 2196 flow [2025-01-09 21:41:09,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 210 transitions, 801 flow [2025-01-09 21:41:09,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:09,501 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:09,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:41:09,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:09,502 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:09,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:09,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:09,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:09,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1243065539, now seen corresponding path program 1 times [2025-01-09 21:41:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-01-09 21:41:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:09,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:09,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-01-09 21:41:09,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520943906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074517058] [2025-01-09 21:41:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:09,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:09,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 720 [2025-01-09 21:41:09,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 210 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 600.3333333333334) internal successors, (1801), 3 states have internal predecessors, (1801), 0 states have call successors, (0), 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-01-09 21:41:09,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 720 [2025-01-09 21:41:09,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,698 INFO L124 PetriNetUnfolderBase]: 39/960 cut-off events. [2025-01-09 21:41:09,698 INFO L125 PetriNetUnfolderBase]: For 1312/1312 co-relation queries the response was YES. [2025-01-09 21:41:09,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 960 events. 39/960 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2455 event pairs, 19 based on Foata normal form. 1/880 useless extension candidates. Maximal degree in co-relation 1249. Up to 139 conditions per place. [2025-01-09 21:41:09,705 INFO L140 encePairwiseOnDemand]: 715/720 looper letters, 28 selfloop transitions, 2 changer transitions 1/207 dead transitions. [2025-01-09 21:41:09,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 207 transitions, 855 flow [2025-01-09 21:41:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1830 transitions. [2025-01-09 21:41:09,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8472222222222222 [2025-01-09 21:41:09,706 INFO L175 Difference]: Start difference. First operand has 246 places, 210 transitions, 801 flow. Second operand 3 states and 1830 transitions. [2025-01-09 21:41:09,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 207 transitions, 855 flow [2025-01-09 21:41:09,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 207 transitions, 582 flow, removed 136 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:09,712 INFO L231 Difference]: Finished difference. Result has 246 places, 206 transitions, 524 flow [2025-01-09 21:41:09,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=720, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=246, PETRI_TRANSITIONS=206} [2025-01-09 21:41:09,712 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 0 predicate places. [2025-01-09 21:41:09,712 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 206 transitions, 524 flow [2025-01-09 21:41:09,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.3333333333334) internal successors, (1801), 3 states have internal predecessors, (1801), 0 states have call successors, (0), 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-01-09 21:41:09,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,713 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] [2025-01-09 21:41:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-01-09 21:41:09,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:09,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -150023863, now seen corresponding path program 1 times [2025-01-09 21:41:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915504958] [2025-01-09 21:41:09,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:09,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:09,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:09,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915504958] [2025-01-09 21:41:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915504958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932676] [2025-01-09 21:41:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:09,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:09,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:09,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:09,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 561 out of 720 [2025-01-09 21:41:09,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 206 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 0 states have call successors, (0), 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-01-09 21:41:09,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:09,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 561 of 720 [2025-01-09 21:41:09,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:09,863 INFO L124 PetriNetUnfolderBase]: 20/861 cut-off events. [2025-01-09 21:41:09,864 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-09 21:41:09,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 861 events. 20/861 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1815 event pairs, 0 based on Foata normal form. 19/841 useless extension candidates. Maximal degree in co-relation 1034. Up to 100 conditions per place. [2025-01-09 21:41:09,869 INFO L140 encePairwiseOnDemand]: 714/720 looper letters, 26 selfloop transitions, 1 changer transitions 24/201 dead transitions. [2025-01-09 21:41:09,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 201 transitions, 572 flow [2025-01-09 21:41:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1717 transitions. [2025-01-09 21:41:09,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7949074074074074 [2025-01-09 21:41:09,870 INFO L175 Difference]: Start difference. First operand has 246 places, 206 transitions, 524 flow. Second operand 3 states and 1717 transitions. [2025-01-09 21:41:09,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 201 transitions, 572 flow [2025-01-09 21:41:09,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 201 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:09,872 INFO L231 Difference]: Finished difference. Result has 240 places, 177 transitions, 462 flow [2025-01-09 21:41:09,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=720, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=240, PETRI_TRANSITIONS=177} [2025-01-09 21:41:09,873 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -6 predicate places. [2025-01-09 21:41:09,873 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 177 transitions, 462 flow [2025-01-09 21:41:09,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 562.0) internal successors, (1686), 3 states have internal predecessors, (1686), 0 states have call successors, (0), 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-01-09 21:41:09,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:09,873 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:09,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-01-09 21:41:09,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:09,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1119929435, now seen corresponding path program 1 times [2025-01-09 21:41:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-01-09 21:41:09,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:09,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 21:41:09,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 21:41:09,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:09,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-01-09 21:41:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430551352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24258756] [2025-01-09 21:41:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:10,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:10,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 720 [2025-01-09 21:41:10,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 177 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 620.6) internal successors, (3103), 5 states have internal predecessors, (3103), 0 states have call successors, (0), 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-01-09 21:41:10,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:10,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 720 [2025-01-09 21:41:10,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,150 INFO L124 PetriNetUnfolderBase]: 0/418 cut-off events. [2025-01-09 21:41:10,150 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2025-01-09 21:41:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 418 events. 0/418 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 244 event pairs, 0 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 0. Up to 62 conditions per place. [2025-01-09 21:41:10,151 INFO L140 encePairwiseOnDemand]: 715/720 looper letters, 26 selfloop transitions, 2 changer transitions 3/179 dead transitions. [2025-01-09 21:41:10,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 179 transitions, 528 flow [2025-01-09 21:41:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3107 transitions. [2025-01-09 21:41:10,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630555555555556 [2025-01-09 21:41:10,154 INFO L175 Difference]: Start difference. First operand has 240 places, 177 transitions, 462 flow. Second operand 5 states and 3107 transitions. [2025-01-09 21:41:10,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 179 transitions, 528 flow [2025-01-09 21:41:10,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 179 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:10,157 INFO L231 Difference]: Finished difference. Result has 220 places, 176 transitions, 467 flow [2025-01-09 21:41:10,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=720, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=220, PETRI_TRANSITIONS=176} [2025-01-09 21:41:10,158 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -26 predicate places. [2025-01-09 21:41:10,158 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 176 transitions, 467 flow [2025-01-09 21:41:10,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 620.6) internal successors, (3103), 5 states have internal predecessors, (3103), 0 states have call successors, (0), 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-01-09 21:41:10,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,158 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:10,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-01-09 21:41:10,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:41:10,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1537515952, now seen corresponding path program 1 times [2025-01-09 21:41:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163282222] [2025-01-09 21:41:10,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 21:41:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 21:41:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:10,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:10,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 21:41:10,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 21:41:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:10,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:10,250 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-01-09 21:41:10,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-01-09 21:41:10,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-01-09 21:41:10,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-01-09 21:41:10,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-01-09 21:41:10,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-01-09 21:41:10,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-01-09 21:41:10,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-01-09 21:41:10,253 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:10,253 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:10,253 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-01-09 21:41:10,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:10,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 774 places, 756 transitions, 2348 flow [2025-01-09 21:41:10,515 INFO L124 PetriNetUnfolderBase]: 82/1291 cut-off events. [2025-01-09 21:41:10,515 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2025-01-09 21:41:10,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 1291 events. 82/1291 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3779 event pairs, 0 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 1540. Up to 40 conditions per place. [2025-01-09 21:41:10,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 774 places, 756 transitions, 2348 flow [2025-01-09 21:41:10,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 217 transitions, 855 flow [2025-01-09 21:41:10,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:10,528 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:10,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-09 21:41:10,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:10,529 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:10,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:10,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:10,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:10,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash 127738051, now seen corresponding path program 1 times [2025-01-09 21:41:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-01-09 21:41:10,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:10,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:10,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:10,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:10,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863614365] [2025-01-09 21:41:10,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863614365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:10,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:10,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708344666] [2025-01-09 21:41:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:10,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:10,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:10,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:10,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:10,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 756 [2025-01-09 21:41:10,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 217 transitions, 855 flow. Second operand has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 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-01-09 21:41:10,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:10,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 756 [2025-01-09 21:41:10,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,738 INFO L124 PetriNetUnfolderBase]: 41/1009 cut-off events. [2025-01-09 21:41:10,738 INFO L125 PetriNetUnfolderBase]: For 1521/1521 co-relation queries the response was YES. [2025-01-09 21:41:10,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 1009 events. 41/1009 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2685 event pairs, 20 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 1326. Up to 146 conditions per place. [2025-01-09 21:41:10,746 INFO L140 encePairwiseOnDemand]: 751/756 looper letters, 29 selfloop transitions, 2 changer transitions 1/214 dead transitions. [2025-01-09 21:41:10,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 214 transitions, 911 flow [2025-01-09 21:41:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1921 transitions. [2025-01-09 21:41:10,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470017636684304 [2025-01-09 21:41:10,748 INFO L175 Difference]: Start difference. First operand has 255 places, 217 transitions, 855 flow. Second operand 3 states and 1921 transitions. [2025-01-09 21:41:10,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 214 transitions, 911 flow [2025-01-09 21:41:10,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 214 transitions, 604 flow, removed 153 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:10,752 INFO L231 Difference]: Finished difference. Result has 255 places, 213 transitions, 544 flow [2025-01-09 21:41:10,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=756, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=255, PETRI_TRANSITIONS=213} [2025-01-09 21:41:10,753 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, 0 predicate places. [2025-01-09 21:41:10,753 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 213 transitions, 544 flow [2025-01-09 21:41:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 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-01-09 21:41:10,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,753 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] [2025-01-09 21:41:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-01-09 21:41:10,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -836935095, now seen corresponding path program 1 times [2025-01-09 21:41:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-01-09 21:41:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:10,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:10,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:10,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-01-09 21:41:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855973633] [2025-01-09 21:41:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:10,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:10,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:10,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 756 [2025-01-09 21:41:10,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 213 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 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-01-09 21:41:10,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:10,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 756 [2025-01-09 21:41:10,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:10,913 INFO L124 PetriNetUnfolderBase]: 21/905 cut-off events. [2025-01-09 21:41:10,914 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-01-09 21:41:10,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 905 events. 21/905 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 1974 event pairs, 0 based on Foata normal form. 20/884 useless extension candidates. Maximal degree in co-relation 1088. Up to 105 conditions per place. [2025-01-09 21:41:10,919 INFO L140 encePairwiseOnDemand]: 750/756 looper letters, 27 selfloop transitions, 1 changer transitions 24/208 dead transitions. [2025-01-09 21:41:10,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 208 transitions, 594 flow [2025-01-09 21:41:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-01-09 21:41:10,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945326278659612 [2025-01-09 21:41:10,921 INFO L175 Difference]: Start difference. First operand has 255 places, 213 transitions, 544 flow. Second operand 3 states and 1802 transitions. [2025-01-09 21:41:10,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 208 transitions, 594 flow [2025-01-09 21:41:10,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 208 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:10,924 INFO L231 Difference]: Finished difference. Result has 249 places, 184 transitions, 482 flow [2025-01-09 21:41:10,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=756, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=249, PETRI_TRANSITIONS=184} [2025-01-09 21:41:10,926 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, -6 predicate places. [2025-01-09 21:41:10,926 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 184 transitions, 482 flow [2025-01-09 21:41:10,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 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-01-09 21:41:10,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:10,927 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:10,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-01-09 21:41:10,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:10,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1980169492, now seen corresponding path program 1 times [2025-01-09 21:41:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-01-09 21:41:10,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:10,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:41:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:41:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-01-09 21:41:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711486291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167119661] [2025-01-09 21:41:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:11,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 646 out of 756 [2025-01-09 21:41:11,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 184 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 651.8) internal successors, (3259), 5 states have internal predecessors, (3259), 0 states have call successors, (0), 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-01-09 21:41:11,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 646 of 756 [2025-01-09 21:41:11,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,166 INFO L124 PetriNetUnfolderBase]: 0/438 cut-off events. [2025-01-09 21:41:11,167 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-01-09 21:41:11,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 438 events. 0/438 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 256 event pairs, 0 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 0. Up to 65 conditions per place. [2025-01-09 21:41:11,167 INFO L140 encePairwiseOnDemand]: 751/756 looper letters, 27 selfloop transitions, 2 changer transitions 3/186 dead transitions. [2025-01-09 21:41:11,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 186 transitions, 550 flow [2025-01-09 21:41:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3263 transitions. [2025-01-09 21:41:11,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8632275132275132 [2025-01-09 21:41:11,169 INFO L175 Difference]: Start difference. First operand has 249 places, 184 transitions, 482 flow. Second operand 5 states and 3263 transitions. [2025-01-09 21:41:11,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 186 transitions, 550 flow [2025-01-09 21:41:11,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 186 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:11,171 INFO L231 Difference]: Finished difference. Result has 229 places, 183 transitions, 487 flow [2025-01-09 21:41:11,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=756, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=487, PETRI_PLACES=229, PETRI_TRANSITIONS=183} [2025-01-09 21:41:11,172 INFO L279 CegarLoopForPetriNet]: 255 programPoint places, -26 predicate places. [2025-01-09 21:41:11,172 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 183 transitions, 487 flow [2025-01-09 21:41:11,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 651.8) internal successors, (3259), 5 states have internal predecessors, (3259), 0 states have call successors, (0), 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-01-09 21:41:11,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,173 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:11,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-01-09 21:41:11,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-01-09 21:41:11,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash 804658531, now seen corresponding path program 1 times [2025-01-09 21:41:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-01-09 21:41:11,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 21:41:11,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 21:41:11,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:11,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:11,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-09 21:41:11,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-09 21:41:11,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:11,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:11,244 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:11,244 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining) [2025-01-09 21:41:11,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-01-09 21:41:11,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-01-09 21:41:11,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-01-09 21:41:11,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2025-01-09 21:41:11,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-01-09 21:41:11,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-01-09 21:41:11,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-01-09 21:41:11,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-01-09 21:41:11,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-01-09 21:41:11,246 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-01-09 21:41:11,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-01-09 21:41:11,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:11,247 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:11,247 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-01-09 21:41:11,322 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:11,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 811 places, 792 transitions, 2504 flow [2025-01-09 21:41:11,439 INFO L124 PetriNetUnfolderBase]: 86/1354 cut-off events. [2025-01-09 21:41:11,439 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2025-01-09 21:41:11,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 1354 events. 86/1354 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3976 event pairs, 0 based on Foata normal form. 0/1201 useless extension candidates. Maximal degree in co-relation 1626. Up to 42 conditions per place. [2025-01-09 21:41:11,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 811 places, 792 transitions, 2504 flow [2025-01-09 21:41:11,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 224 transitions, 911 flow [2025-01-09 21:41:11,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:11,455 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:11,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:41:11,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:11,456 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:11,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:11,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:11,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:11,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash -222611261, now seen corresponding path program 1 times [2025-01-09 21:41:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396729130] [2025-01-09 21:41:11,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:11,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:11,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396729130] [2025-01-09 21:41:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396729130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49895653] [2025-01-09 21:41:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:11,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:11,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 792 [2025-01-09 21:41:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 224 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 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-01-09 21:41:11,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 792 [2025-01-09 21:41:11,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,669 INFO L124 PetriNetUnfolderBase]: 43/1058 cut-off events. [2025-01-09 21:41:11,669 INFO L125 PetriNetUnfolderBase]: For 1751/1751 co-relation queries the response was YES. [2025-01-09 21:41:11,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 1058 events. 43/1058 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2819 event pairs, 21 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 1404. Up to 153 conditions per place. [2025-01-09 21:41:11,676 INFO L140 encePairwiseOnDemand]: 787/792 looper letters, 30 selfloop transitions, 2 changer transitions 1/221 dead transitions. [2025-01-09 21:41:11,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 221 transitions, 969 flow [2025-01-09 21:41:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-01-09 21:41:11,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8468013468013468 [2025-01-09 21:41:11,678 INFO L175 Difference]: Start difference. First operand has 264 places, 224 transitions, 911 flow. Second operand 3 states and 2012 transitions. [2025-01-09 21:41:11,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 221 transitions, 969 flow [2025-01-09 21:41:11,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 221 transitions, 626 flow, removed 171 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:11,683 INFO L231 Difference]: Finished difference. Result has 264 places, 220 transitions, 564 flow [2025-01-09 21:41:11,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=264, PETRI_TRANSITIONS=220} [2025-01-09 21:41:11,683 INFO L279 CegarLoopForPetriNet]: 264 programPoint places, 0 predicate places. [2025-01-09 21:41:11,683 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 220 transitions, 564 flow [2025-01-09 21:41:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 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-01-09 21:41:11,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,684 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] [2025-01-09 21:41:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-01-09 21:41:11,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:11,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1306755145, now seen corresponding path program 1 times [2025-01-09 21:41:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838291599] [2025-01-09 21:41:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:11,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838291599] [2025-01-09 21:41:11,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838291599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:11,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758364949] [2025-01-09 21:41:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:11,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:11,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 792 [2025-01-09 21:41:11,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 220 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 618.0) internal successors, (1854), 3 states have internal predecessors, (1854), 0 states have call successors, (0), 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-01-09 21:41:11,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:11,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 792 [2025-01-09 21:41:11,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:11,853 INFO L124 PetriNetUnfolderBase]: 22/949 cut-off events. [2025-01-09 21:41:11,854 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-01-09 21:41:11,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 949 events. 22/949 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2075 event pairs, 0 based on Foata normal form. 21/927 useless extension candidates. Maximal degree in co-relation 1142. Up to 110 conditions per place. [2025-01-09 21:41:11,860 INFO L140 encePairwiseOnDemand]: 786/792 looper letters, 28 selfloop transitions, 1 changer transitions 24/215 dead transitions. [2025-01-09 21:41:11,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 215 transitions, 616 flow [2025-01-09 21:41:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1887 transitions. [2025-01-09 21:41:11,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7941919191919192 [2025-01-09 21:41:11,861 INFO L175 Difference]: Start difference. First operand has 264 places, 220 transitions, 564 flow. Second operand 3 states and 1887 transitions. [2025-01-09 21:41:11,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 215 transitions, 616 flow [2025-01-09 21:41:11,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 215 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:11,864 INFO L231 Difference]: Finished difference. Result has 258 places, 191 transitions, 502 flow [2025-01-09 21:41:11,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=258, PETRI_TRANSITIONS=191} [2025-01-09 21:41:11,864 INFO L279 CegarLoopForPetriNet]: 264 programPoint places, -6 predicate places. [2025-01-09 21:41:11,864 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 191 transitions, 502 flow [2025-01-09 21:41:11,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 618.0) internal successors, (1854), 3 states have internal predecessors, (1854), 0 states have call successors, (0), 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-01-09 21:41:11,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:11,865 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:11,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-01-09 21:41:11,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:11,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -765930594, now seen corresponding path program 1 times [2025-01-09 21:41:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:11,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301317793] [2025-01-09 21:41:11,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:11,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 21:41:11,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 21:41:11,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:11,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301317793] [2025-01-09 21:41:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301317793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484279832] [2025-01-09 21:41:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:12,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 677 out of 792 [2025-01-09 21:41:12,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 191 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 683.0) internal successors, (3415), 5 states have internal predecessors, (3415), 0 states have call successors, (0), 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-01-09 21:41:12,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 677 of 792 [2025-01-09 21:41:12,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:12,127 INFO L124 PetriNetUnfolderBase]: 0/458 cut-off events. [2025-01-09 21:41:12,128 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-01-09 21:41:12,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 458 events. 0/458 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 267 event pairs, 0 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 0. Up to 68 conditions per place. [2025-01-09 21:41:12,128 INFO L140 encePairwiseOnDemand]: 787/792 looper letters, 28 selfloop transitions, 2 changer transitions 3/193 dead transitions. [2025-01-09 21:41:12,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 193 transitions, 572 flow [2025-01-09 21:41:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3419 transitions. [2025-01-09 21:41:12,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8633838383838384 [2025-01-09 21:41:12,130 INFO L175 Difference]: Start difference. First operand has 258 places, 191 transitions, 502 flow. Second operand 5 states and 3419 transitions. [2025-01-09 21:41:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 193 transitions, 572 flow [2025-01-09 21:41:12,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 193 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:12,132 INFO L231 Difference]: Finished difference. Result has 238 places, 190 transitions, 507 flow [2025-01-09 21:41:12,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=792, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=238, PETRI_TRANSITIONS=190} [2025-01-09 21:41:12,132 INFO L279 CegarLoopForPetriNet]: 264 programPoint places, -26 predicate places. [2025-01-09 21:41:12,133 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 190 transitions, 507 flow [2025-01-09 21:41:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 683.0) internal successors, (3415), 5 states have internal predecessors, (3415), 0 states have call successors, (0), 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-01-09 21:41:12,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,133 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-01-09 21:41:12,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:41:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash 857380029, now seen corresponding path program 1 times [2025-01-09 21:41:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496733580] [2025-01-09 21:41:12,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 21:41:12,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 21:41:12,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:12,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:12,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 21:41:12,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 21:41:12,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:12,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:12,198 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:12,198 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2025-01-09 21:41:12,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2025-01-09 21:41:12,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2025-01-09 21:41:12,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2025-01-09 21:41:12,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-01-09 21:41:12,200 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:12,201 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:12,201 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-01-09 21:41:12,271 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:12,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 848 places, 828 transitions, 2664 flow [2025-01-09 21:41:12,401 INFO L124 PetriNetUnfolderBase]: 90/1417 cut-off events. [2025-01-09 21:41:12,401 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2025-01-09 21:41:12,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 1417 events. 90/1417 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4103 event pairs, 0 based on Foata normal form. 0/1257 useless extension candidates. Maximal degree in co-relation 1713. Up to 44 conditions per place. [2025-01-09 21:41:12,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 848 places, 828 transitions, 2664 flow [2025-01-09 21:41:12,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 231 transitions, 969 flow [2025-01-09 21:41:12,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:12,416 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:12,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 21:41:12,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:12,417 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:12,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:12,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:12,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:41:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 192017603, now seen corresponding path program 1 times [2025-01-09 21:41:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738663914] [2025-01-09 21:41:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:12,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:12,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738663914] [2025-01-09 21:41:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738663914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872605618] [2025-01-09 21:41:12,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:12,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:12,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 828 [2025-01-09 21:41:12,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 231 transitions, 969 flow. Second operand has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 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-01-09 21:41:12,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 828 [2025-01-09 21:41:12,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:12,644 INFO L124 PetriNetUnfolderBase]: 45/1107 cut-off events. [2025-01-09 21:41:12,644 INFO L125 PetriNetUnfolderBase]: For 2003/2003 co-relation queries the response was YES. [2025-01-09 21:41:12,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 1107 events. 45/1107 cut-off events. For 2003/2003 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2970 event pairs, 22 based on Foata normal form. 1/1015 useless extension candidates. Maximal degree in co-relation 1483. Up to 160 conditions per place. [2025-01-09 21:41:12,655 INFO L140 encePairwiseOnDemand]: 823/828 looper letters, 31 selfloop transitions, 2 changer transitions 1/228 dead transitions. [2025-01-09 21:41:12,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 228 transitions, 1029 flow [2025-01-09 21:41:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2103 transitions. [2025-01-09 21:41:12,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8466183574879227 [2025-01-09 21:41:12,657 INFO L175 Difference]: Start difference. First operand has 273 places, 231 transitions, 969 flow. Second operand 3 states and 2103 transitions. [2025-01-09 21:41:12,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 228 transitions, 1029 flow [2025-01-09 21:41:12,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 228 transitions, 648 flow, removed 190 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:12,661 INFO L231 Difference]: Finished difference. Result has 273 places, 227 transitions, 584 flow [2025-01-09 21:41:12,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=828, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=273, PETRI_TRANSITIONS=227} [2025-01-09 21:41:12,661 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, 0 predicate places. [2025-01-09 21:41:12,661 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 227 transitions, 584 flow [2025-01-09 21:41:12,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 690.3333333333334) internal successors, (2071), 3 states have internal predecessors, (2071), 0 states have call successors, (0), 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-01-09 21:41:12,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,662 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] [2025-01-09 21:41:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-01-09 21:41:12,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:41:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1986079561, now seen corresponding path program 1 times [2025-01-09 21:41:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482675321] [2025-01-09 21:41:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:12,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:12,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:12,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482675321] [2025-01-09 21:41:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482675321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698031015] [2025-01-09 21:41:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:12,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:12,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 828 [2025-01-09 21:41:12,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 227 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 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-01-09 21:41:12,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:12,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 828 [2025-01-09 21:41:12,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:12,890 INFO L124 PetriNetUnfolderBase]: 23/993 cut-off events. [2025-01-09 21:41:12,890 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-01-09 21:41:12,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 993 events. 23/993 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2177 event pairs, 0 based on Foata normal form. 22/970 useless extension candidates. Maximal degree in co-relation 1196. Up to 115 conditions per place. [2025-01-09 21:41:12,897 INFO L140 encePairwiseOnDemand]: 822/828 looper letters, 29 selfloop transitions, 1 changer transitions 24/222 dead transitions. [2025-01-09 21:41:12,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 222 transitions, 638 flow [2025-01-09 21:41:12,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1972 transitions. [2025-01-09 21:41:12,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938808373590982 [2025-01-09 21:41:12,898 INFO L175 Difference]: Start difference. First operand has 273 places, 227 transitions, 584 flow. Second operand 3 states and 1972 transitions. [2025-01-09 21:41:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 222 transitions, 638 flow [2025-01-09 21:41:12,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 222 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:12,901 INFO L231 Difference]: Finished difference. Result has 267 places, 198 transitions, 522 flow [2025-01-09 21:41:12,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=828, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=267, PETRI_TRANSITIONS=198} [2025-01-09 21:41:12,901 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -6 predicate places. [2025-01-09 21:41:12,901 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 198 transitions, 522 flow [2025-01-09 21:41:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 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-01-09 21:41:12,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:12,902 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-01-09 21:41:12,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:41:12,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1856201285, now seen corresponding path program 1 times [2025-01-09 21:41:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-01-09 21:41:12,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:12,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 21:41:12,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 21:41:12,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:12,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365254704] [2025-01-09 21:41:12,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365254704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:12,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:12,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335670058] [2025-01-09 21:41:12,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:12,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:12,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:12,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:13,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 828 [2025-01-09 21:41:13,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 198 transitions, 522 flow. Second operand has 5 states, 5 states have (on average 714.2) internal successors, (3571), 5 states have internal predecessors, (3571), 0 states have call successors, (0), 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-01-09 21:41:13,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:13,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 828 [2025-01-09 21:41:13,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:13,120 INFO L124 PetriNetUnfolderBase]: 0/478 cut-off events. [2025-01-09 21:41:13,121 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-01-09 21:41:13,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 478 events. 0/478 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 279 event pairs, 0 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 0. Up to 71 conditions per place. [2025-01-09 21:41:13,121 INFO L140 encePairwiseOnDemand]: 823/828 looper letters, 29 selfloop transitions, 2 changer transitions 3/200 dead transitions. [2025-01-09 21:41:13,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 200 transitions, 594 flow [2025-01-09 21:41:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3575 transitions. [2025-01-09 21:41:13,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-01-09 21:41:13,127 INFO L175 Difference]: Start difference. First operand has 267 places, 198 transitions, 522 flow. Second operand 5 states and 3575 transitions. [2025-01-09 21:41:13,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 200 transitions, 594 flow [2025-01-09 21:41:13,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 200 transitions, 593 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:13,129 INFO L231 Difference]: Finished difference. Result has 247 places, 197 transitions, 527 flow [2025-01-09 21:41:13,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=828, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=247, PETRI_TRANSITIONS=197} [2025-01-09 21:41:13,129 INFO L279 CegarLoopForPetriNet]: 273 programPoint places, -26 predicate places. [2025-01-09 21:41:13,129 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 197 transitions, 527 flow [2025-01-09 21:41:13,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 714.2) internal successors, (3571), 5 states have internal predecessors, (3571), 0 states have call successors, (0), 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-01-09 21:41:13,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,130 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:13,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-01-09 21:41:13,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-01-09 21:41:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 577560926, now seen corresponding path program 1 times [2025-01-09 21:41:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-01-09 21:41:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 21:41:13,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 21:41:13,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:13,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:13,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-01-09 21:41:13,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-01-09 21:41:13,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:13,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:13,206 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:13,206 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 29 remaining) [2025-01-09 21:41:13,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-01-09 21:41:13,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-01-09 21:41:13,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-01-09 21:41:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-01-09 21:41:13,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:13,210 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:13,210 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-01-09 21:41:13,287 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:13,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 885 places, 864 transitions, 2828 flow [2025-01-09 21:41:13,421 INFO L124 PetriNetUnfolderBase]: 94/1480 cut-off events. [2025-01-09 21:41:13,421 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2025-01-09 21:41:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1480 events. 94/1480 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4204 event pairs, 0 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1801. Up to 46 conditions per place. [2025-01-09 21:41:13,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 885 places, 864 transitions, 2828 flow [2025-01-09 21:41:13,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 238 transitions, 1029 flow [2025-01-09 21:41:13,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:13,440 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:13,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 21:41:13,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:13,441 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:13,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:13,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:13,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1371624643, now seen corresponding path program 1 times [2025-01-09 21:41:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612439999] [2025-01-09 21:41:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:13,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:13,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:13,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:13,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612439999] [2025-01-09 21:41:13,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612439999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:13,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:13,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:13,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786367118] [2025-01-09 21:41:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:13,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:13,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:13,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:13,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 719 out of 864 [2025-01-09 21:41:13,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 238 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 720.3333333333334) internal successors, (2161), 3 states have internal predecessors, (2161), 0 states have call successors, (0), 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-01-09 21:41:13,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:13,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 719 of 864 [2025-01-09 21:41:13,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:13,847 INFO L124 PetriNetUnfolderBase]: 47/1156 cut-off events. [2025-01-09 21:41:13,848 INFO L125 PetriNetUnfolderBase]: For 2278/2278 co-relation queries the response was YES. [2025-01-09 21:41:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 1156 events. 47/1156 cut-off events. For 2278/2278 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3088 event pairs, 23 based on Foata normal form. 1/1060 useless extension candidates. Maximal degree in co-relation 1563. Up to 167 conditions per place. [2025-01-09 21:41:13,857 INFO L140 encePairwiseOnDemand]: 859/864 looper letters, 32 selfloop transitions, 2 changer transitions 1/235 dead transitions. [2025-01-09 21:41:13,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 235 transitions, 1091 flow [2025-01-09 21:41:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2194 transitions. [2025-01-09 21:41:13,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464506172839507 [2025-01-09 21:41:13,860 INFO L175 Difference]: Start difference. First operand has 282 places, 238 transitions, 1029 flow. Second operand 3 states and 2194 transitions. [2025-01-09 21:41:13,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 235 transitions, 1091 flow [2025-01-09 21:41:13,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 235 transitions, 670 flow, removed 210 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:13,866 INFO L231 Difference]: Finished difference. Result has 282 places, 234 transitions, 604 flow [2025-01-09 21:41:13,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=864, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=282, PETRI_TRANSITIONS=234} [2025-01-09 21:41:13,870 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, 0 predicate places. [2025-01-09 21:41:13,873 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 234 transitions, 604 flow [2025-01-09 21:41:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 720.3333333333334) internal successors, (2161), 3 states have internal predecessors, (2161), 0 states have call successors, (0), 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-01-09 21:41:13,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:13,873 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] [2025-01-09 21:41:13,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-01-09 21:41:13,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:13,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1201038153, now seen corresponding path program 1 times [2025-01-09 21:41:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-01-09 21:41:13,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:13,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:13,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:13,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:13,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592253610] [2025-01-09 21:41:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592253610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:13,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:13,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340729308] [2025-01-09 21:41:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:13,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:13,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:13,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:13,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 673 out of 864 [2025-01-09 21:41:13,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 234 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 674.0) internal successors, (2022), 3 states have internal predecessors, (2022), 0 states have call successors, (0), 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-01-09 21:41:13,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:13,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 673 of 864 [2025-01-09 21:41:13,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:14,145 INFO L124 PetriNetUnfolderBase]: 24/1037 cut-off events. [2025-01-09 21:41:14,145 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-01-09 21:41:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1037 events. 24/1037 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2281 event pairs, 0 based on Foata normal form. 23/1013 useless extension candidates. Maximal degree in co-relation 1250. Up to 120 conditions per place. [2025-01-09 21:41:14,154 INFO L140 encePairwiseOnDemand]: 858/864 looper letters, 30 selfloop transitions, 1 changer transitions 24/229 dead transitions. [2025-01-09 21:41:14,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 229 transitions, 660 flow [2025-01-09 21:41:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2057 transitions. [2025-01-09 21:41:14,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7935956790123457 [2025-01-09 21:41:14,156 INFO L175 Difference]: Start difference. First operand has 282 places, 234 transitions, 604 flow. Second operand 3 states and 2057 transitions. [2025-01-09 21:41:14,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 229 transitions, 660 flow [2025-01-09 21:41:14,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 229 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:14,159 INFO L231 Difference]: Finished difference. Result has 276 places, 205 transitions, 542 flow [2025-01-09 21:41:14,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=864, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=276, PETRI_TRANSITIONS=205} [2025-01-09 21:41:14,159 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2025-01-09 21:41:14,159 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 205 transitions, 542 flow [2025-01-09 21:41:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.0) internal successors, (2022), 3 states have internal predecessors, (2022), 0 states have call successors, (0), 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-01-09 21:41:14,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,159 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:14,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-01-09 21:41:14,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:14,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1337385283, now seen corresponding path program 1 times [2025-01-09 21:41:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-01-09 21:41:14,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 21:41:14,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 21:41:14,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-01-09 21:41:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406960763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394531130] [2025-01-09 21:41:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:14,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:14,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:14,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 864 [2025-01-09 21:41:14,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 205 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 745.4) internal successors, (3727), 5 states have internal predecessors, (3727), 0 states have call successors, (0), 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-01-09 21:41:14,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:14,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 864 [2025-01-09 21:41:14,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:14,414 INFO L124 PetriNetUnfolderBase]: 0/498 cut-off events. [2025-01-09 21:41:14,415 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2025-01-09 21:41:14,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 498 events. 0/498 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 291 event pairs, 0 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 0. Up to 74 conditions per place. [2025-01-09 21:41:14,415 INFO L140 encePairwiseOnDemand]: 859/864 looper letters, 30 selfloop transitions, 2 changer transitions 3/207 dead transitions. [2025-01-09 21:41:14,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 207 transitions, 616 flow [2025-01-09 21:41:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3731 transitions. [2025-01-09 21:41:14,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8636574074074074 [2025-01-09 21:41:14,417 INFO L175 Difference]: Start difference. First operand has 276 places, 205 transitions, 542 flow. Second operand 5 states and 3731 transitions. [2025-01-09 21:41:14,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 207 transitions, 616 flow [2025-01-09 21:41:14,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 207 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:14,419 INFO L231 Difference]: Finished difference. Result has 256 places, 204 transitions, 547 flow [2025-01-09 21:41:14,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=864, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=256, PETRI_TRANSITIONS=204} [2025-01-09 21:41:14,420 INFO L279 CegarLoopForPetriNet]: 282 programPoint places, -26 predicate places. [2025-01-09 21:41:14,420 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 204 transitions, 547 flow [2025-01-09 21:41:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 745.4) internal successors, (3727), 5 states have internal predecessors, (3727), 0 states have call successors, (0), 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-01-09 21:41:14,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,420 INFO L206 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:14,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-01-09 21:41:14,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-01-09 21:41:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 104869958, now seen corresponding path program 1 times [2025-01-09 21:41:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351475432] [2025-01-09 21:41:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 21:41:14,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 21:41:14,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:14,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:14,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 21:41:14,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 21:41:14,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:14,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:14,495 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 30 remaining) [2025-01-09 21:41:14,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2025-01-09 21:41:14,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2025-01-09 21:41:14,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2025-01-09 21:41:14,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2025-01-09 21:41:14,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2025-01-09 21:41:14,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2025-01-09 21:41:14,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-01-09 21:41:14,497 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:14,497 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:14,497 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-01-09 21:41:14,568 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:14,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 922 places, 900 transitions, 2996 flow [2025-01-09 21:41:14,711 INFO L124 PetriNetUnfolderBase]: 98/1543 cut-off events. [2025-01-09 21:41:14,711 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2025-01-09 21:41:14,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1543 events. 98/1543 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4348 event pairs, 0 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 1890. Up to 48 conditions per place. [2025-01-09 21:41:14,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 922 places, 900 transitions, 2996 flow [2025-01-09 21:41:14,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 245 transitions, 1091 flow [2025-01-09 21:41:14,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:14,730 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:14,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:41:14,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:14,731 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:14,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:14,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:14,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:14,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash -978757437, now seen corresponding path program 1 times [2025-01-09 21:41:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320589186] [2025-01-09 21:41:14,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:14,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:14,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:14,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:14,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320589186] [2025-01-09 21:41:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320589186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737949044] [2025-01-09 21:41:14,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:14,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 900 [2025-01-09 21:41:14,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 245 transitions, 1091 flow. Second operand has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 0 states have call successors, (0), 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-01-09 21:41:14,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:14,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 900 [2025-01-09 21:41:14,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,016 INFO L124 PetriNetUnfolderBase]: 49/1205 cut-off events. [2025-01-09 21:41:15,016 INFO L125 PetriNetUnfolderBase]: For 2577/2577 co-relation queries the response was YES. [2025-01-09 21:41:15,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1205 events. 49/1205 cut-off events. For 2577/2577 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 3106 event pairs, 24 based on Foata normal form. 1/1105 useless extension candidates. Maximal degree in co-relation 1644. Up to 174 conditions per place. [2025-01-09 21:41:15,026 INFO L140 encePairwiseOnDemand]: 895/900 looper letters, 33 selfloop transitions, 2 changer transitions 1/242 dead transitions. [2025-01-09 21:41:15,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 242 transitions, 1155 flow [2025-01-09 21:41:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-01-09 21:41:15,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462962962962963 [2025-01-09 21:41:15,031 INFO L175 Difference]: Start difference. First operand has 291 places, 245 transitions, 1091 flow. Second operand 3 states and 2285 transitions. [2025-01-09 21:41:15,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 242 transitions, 1155 flow [2025-01-09 21:41:15,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 242 transitions, 692 flow, removed 231 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:15,035 INFO L231 Difference]: Finished difference. Result has 291 places, 241 transitions, 624 flow [2025-01-09 21:41:15,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=900, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=291, PETRI_TRANSITIONS=241} [2025-01-09 21:41:15,036 INFO L279 CegarLoopForPetriNet]: 291 programPoint places, 0 predicate places. [2025-01-09 21:41:15,036 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 241 transitions, 624 flow [2025-01-09 21:41:15,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 750.3333333333334) internal successors, (2251), 3 states have internal predecessors, (2251), 0 states have call successors, (0), 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-01-09 21:41:15,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,036 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] [2025-01-09 21:41:15,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-01-09 21:41:15,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:15,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1048369079, now seen corresponding path program 1 times [2025-01-09 21:41:15,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:41:15,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:15,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:15,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 21:41:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423764901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-01-09 21:41:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:15,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 900 [2025-01-09 21:41:15,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 241 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 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-01-09 21:41:15,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:15,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 900 [2025-01-09 21:41:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,253 INFO L124 PetriNetUnfolderBase]: 25/1081 cut-off events. [2025-01-09 21:41:15,253 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-01-09 21:41:15,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1081 events. 25/1081 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2334 event pairs, 0 based on Foata normal form. 24/1056 useless extension candidates. Maximal degree in co-relation 1304. Up to 125 conditions per place. [2025-01-09 21:41:15,260 INFO L140 encePairwiseOnDemand]: 894/900 looper letters, 31 selfloop transitions, 1 changer transitions 24/236 dead transitions. [2025-01-09 21:41:15,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 236 transitions, 682 flow [2025-01-09 21:41:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2025-01-09 21:41:15,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2025-01-09 21:41:15,261 INFO L175 Difference]: Start difference. First operand has 291 places, 241 transitions, 624 flow. Second operand 3 states and 2142 transitions. [2025-01-09 21:41:15,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 236 transitions, 682 flow [2025-01-09 21:41:15,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 236 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:15,264 INFO L231 Difference]: Finished difference. Result has 285 places, 212 transitions, 562 flow [2025-01-09 21:41:15,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=900, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=285, PETRI_TRANSITIONS=212} [2025-01-09 21:41:15,264 INFO L279 CegarLoopForPetriNet]: 291 programPoint places, -6 predicate places. [2025-01-09 21:41:15,264 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 212 transitions, 562 flow [2025-01-09 21:41:15,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 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-01-09 21:41:15,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,265 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:15,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-01-09 21:41:15,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1776201270, now seen corresponding path program 1 times [2025-01-09 21:41:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-01-09 21:41:15,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-09 21:41:15,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-09 21:41:15,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-01-09 21:41:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163986276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508775657] [2025-01-09 21:41:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:15,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:15,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 770 out of 900 [2025-01-09 21:41:15,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 212 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 776.6) internal successors, (3883), 5 states have internal predecessors, (3883), 0 states have call successors, (0), 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-01-09 21:41:15,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:15,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 770 of 900 [2025-01-09 21:41:15,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:15,524 INFO L124 PetriNetUnfolderBase]: 0/518 cut-off events. [2025-01-09 21:41:15,524 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-01-09 21:41:15,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 518 events. 0/518 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 304 event pairs, 0 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 0. Up to 77 conditions per place. [2025-01-09 21:41:15,524 INFO L140 encePairwiseOnDemand]: 895/900 looper letters, 31 selfloop transitions, 2 changer transitions 3/214 dead transitions. [2025-01-09 21:41:15,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 214 transitions, 638 flow [2025-01-09 21:41:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3887 transitions. [2025-01-09 21:41:15,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8637777777777778 [2025-01-09 21:41:15,526 INFO L175 Difference]: Start difference. First operand has 285 places, 212 transitions, 562 flow. Second operand 5 states and 3887 transitions. [2025-01-09 21:41:15,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 214 transitions, 638 flow [2025-01-09 21:41:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 214 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:15,529 INFO L231 Difference]: Finished difference. Result has 265 places, 211 transitions, 567 flow [2025-01-09 21:41:15,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=900, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=211} [2025-01-09 21:41:15,529 INFO L279 CegarLoopForPetriNet]: 291 programPoint places, -26 predicate places. [2025-01-09 21:41:15,529 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 211 transitions, 567 flow [2025-01-09 21:41:15,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 776.6) internal successors, (3883), 5 states have internal predecessors, (3883), 0 states have call successors, (0), 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-01-09 21:41:15,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,530 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-01-09 21:41:15,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:41:15,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash 872857205, now seen corresponding path program 1 times [2025-01-09 21:41:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937719815] [2025-01-09 21:41:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 21:41:15,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 21:41:15,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:15,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 21:41:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 21:41:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:15,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:15,615 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:15,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-01-09 21:41:15,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-01-09 21:41:15,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-01-09 21:41:15,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-01-09 21:41:15,617 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:15,618 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:15,618 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-01-09 21:41:15,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:15,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 959 places, 936 transitions, 3168 flow [2025-01-09 21:41:15,915 INFO L124 PetriNetUnfolderBase]: 102/1606 cut-off events. [2025-01-09 21:41:15,915 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2025-01-09 21:41:15,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1606 events. 102/1606 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4545 event pairs, 0 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 1980. Up to 50 conditions per place. [2025-01-09 21:41:15,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 959 places, 936 transitions, 3168 flow [2025-01-09 21:41:15,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 252 transitions, 1155 flow [2025-01-09 21:41:15,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:15,925 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:15,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-09 21:41:15,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:15,926 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:15,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:15,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:15,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:15,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1730805955, now seen corresponding path program 1 times [2025-01-09 21:41:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940507422] [2025-01-09 21:41:15,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:15,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:15,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:15,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940507422] [2025-01-09 21:41:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940507422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:15,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:15,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293880675] [2025-01-09 21:41:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:15,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:15,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:16,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 779 out of 936 [2025-01-09 21:41:16,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 252 transitions, 1155 flow. Second operand has 3 states, 3 states have (on average 780.3333333333334) internal successors, (2341), 3 states have internal predecessors, (2341), 0 states have call successors, (0), 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-01-09 21:41:16,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 779 of 936 [2025-01-09 21:41:16,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:16,177 INFO L124 PetriNetUnfolderBase]: 51/1254 cut-off events. [2025-01-09 21:41:16,177 INFO L125 PetriNetUnfolderBase]: For 2901/2901 co-relation queries the response was YES. [2025-01-09 21:41:16,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1254 events. 51/1254 cut-off events. For 2901/2901 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3387 event pairs, 25 based on Foata normal form. 1/1150 useless extension candidates. Maximal degree in co-relation 1726. Up to 181 conditions per place. [2025-01-09 21:41:16,190 INFO L140 encePairwiseOnDemand]: 931/936 looper letters, 34 selfloop transitions, 2 changer transitions 1/249 dead transitions. [2025-01-09 21:41:16,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 249 transitions, 1221 flow [2025-01-09 21:41:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2376 transitions. [2025-01-09 21:41:16,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2025-01-09 21:41:16,191 INFO L175 Difference]: Start difference. First operand has 300 places, 252 transitions, 1155 flow. Second operand 3 states and 2376 transitions. [2025-01-09 21:41:16,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 249 transitions, 1221 flow [2025-01-09 21:41:16,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 249 transitions, 714 flow, removed 253 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:16,196 INFO L231 Difference]: Finished difference. Result has 300 places, 248 transitions, 644 flow [2025-01-09 21:41:16,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=936, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=300, PETRI_TRANSITIONS=248} [2025-01-09 21:41:16,197 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, 0 predicate places. [2025-01-09 21:41:16,197 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 248 transitions, 644 flow [2025-01-09 21:41:16,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 780.3333333333334) internal successors, (2341), 3 states have internal predecessors, (2341), 0 states have call successors, (0), 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-01-09 21:41:16,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,197 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] [2025-01-09 21:41:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-01-09 21:41:16,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:16,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash -467174839, now seen corresponding path program 1 times [2025-01-09 21:41:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-01-09 21:41:16,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:16,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:16,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-01-09 21:41:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056640750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277083518] [2025-01-09 21:41:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:16,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 936 [2025-01-09 21:41:16,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 248 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 0 states have call successors, (0), 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-01-09 21:41:16,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 936 [2025-01-09 21:41:16,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:16,412 INFO L124 PetriNetUnfolderBase]: 26/1125 cut-off events. [2025-01-09 21:41:16,412 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2025-01-09 21:41:16,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1125 events. 26/1125 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2484 event pairs, 0 based on Foata normal form. 25/1099 useless extension candidates. Maximal degree in co-relation 1358. Up to 130 conditions per place. [2025-01-09 21:41:16,421 INFO L140 encePairwiseOnDemand]: 930/936 looper letters, 32 selfloop transitions, 1 changer transitions 24/243 dead transitions. [2025-01-09 21:41:16,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 243 transitions, 704 flow [2025-01-09 21:41:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2025-01-09 21:41:16,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930911680911681 [2025-01-09 21:41:16,422 INFO L175 Difference]: Start difference. First operand has 300 places, 248 transitions, 644 flow. Second operand 3 states and 2227 transitions. [2025-01-09 21:41:16,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 243 transitions, 704 flow [2025-01-09 21:41:16,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 243 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:16,425 INFO L231 Difference]: Finished difference. Result has 294 places, 219 transitions, 582 flow [2025-01-09 21:41:16,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=936, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=294, PETRI_TRANSITIONS=219} [2025-01-09 21:41:16,425 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -6 predicate places. [2025-01-09 21:41:16,425 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 219 transitions, 582 flow [2025-01-09 21:41:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 730.0) internal successors, (2190), 3 states have internal predecessors, (2190), 0 states have call successors, (0), 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-01-09 21:41:16,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,426 INFO L206 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:16,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-01-09 21:41:16,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:16,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1998562452, now seen corresponding path program 1 times [2025-01-09 21:41:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948104780] [2025-01-09 21:41:16,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-09 21:41:16,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-09 21:41:16,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948104780] [2025-01-09 21:41:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948104780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914422179] [2025-01-09 21:41:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:16,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:16,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:16,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 801 out of 936 [2025-01-09 21:41:16,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 219 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 807.8) internal successors, (4039), 5 states have internal predecessors, (4039), 0 states have call successors, (0), 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-01-09 21:41:16,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:16,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 801 of 936 [2025-01-09 21:41:16,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:16,666 INFO L124 PetriNetUnfolderBase]: 0/538 cut-off events. [2025-01-09 21:41:16,666 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-01-09 21:41:16,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 538 events. 0/538 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 316 event pairs, 0 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 0. Up to 80 conditions per place. [2025-01-09 21:41:16,667 INFO L140 encePairwiseOnDemand]: 931/936 looper letters, 32 selfloop transitions, 2 changer transitions 3/221 dead transitions. [2025-01-09 21:41:16,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 221 transitions, 660 flow [2025-01-09 21:41:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4043 transitions. [2025-01-09 21:41:16,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-01-09 21:41:16,669 INFO L175 Difference]: Start difference. First operand has 294 places, 219 transitions, 582 flow. Second operand 5 states and 4043 transitions. [2025-01-09 21:41:16,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 221 transitions, 660 flow [2025-01-09 21:41:16,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 221 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:16,671 INFO L231 Difference]: Finished difference. Result has 274 places, 218 transitions, 587 flow [2025-01-09 21:41:16,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=936, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=274, PETRI_TRANSITIONS=218} [2025-01-09 21:41:16,672 INFO L279 CegarLoopForPetriNet]: 300 programPoint places, -26 predicate places. [2025-01-09 21:41:16,672 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 218 transitions, 587 flow [2025-01-09 21:41:16,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 807.8) internal successors, (4039), 5 states have internal predecessors, (4039), 0 states have call successors, (0), 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-01-09 21:41:16,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:16,672 INFO L206 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-01-09 21:41:16,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-01-09 21:41:16,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:16,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1933453077, now seen corresponding path program 1 times [2025-01-09 21:41:16,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-01-09 21:41:16,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:16,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 21:41:16,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 21:41:16,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:16,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:16,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-09 21:41:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-09 21:41:16,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:16,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:16,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:16,756 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:16,756 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-01-09 21:41:16,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2025-01-09 21:41:16,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2025-01-09 21:41:16,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2025-01-09 21:41:16,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2025-01-09 21:41:16,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2025-01-09 21:41:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-01-09 21:41:16,757 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:16,758 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:16,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-01-09 21:41:16,879 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:16,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 996 places, 972 transitions, 3344 flow [2025-01-09 21:41:17,094 INFO L124 PetriNetUnfolderBase]: 106/1669 cut-off events. [2025-01-09 21:41:17,095 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2025-01-09 21:41:17,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 1669 events. 106/1669 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4731 event pairs, 0 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 2071. Up to 52 conditions per place. [2025-01-09 21:41:17,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 996 places, 972 transitions, 3344 flow [2025-01-09 21:41:17,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 309 places, 259 transitions, 1221 flow [2025-01-09 21:41:17,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:17,114 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:17,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-09 21:41:17,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:17,115 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:17,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:17,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:17,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 910380227, now seen corresponding path program 1 times [2025-01-09 21:41:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611663376] [2025-01-09 21:41:17,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:17,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:17,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:17,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611663376] [2025-01-09 21:41:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611663376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:17,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:17,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974533572] [2025-01-09 21:41:17,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:17,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:17,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:17,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:17,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:17,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 809 out of 972 [2025-01-09 21:41:17,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 259 transitions, 1221 flow. Second operand has 3 states, 3 states have (on average 810.3333333333334) internal successors, (2431), 3 states have internal predecessors, (2431), 0 states have call successors, (0), 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-01-09 21:41:17,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:17,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 809 of 972 [2025-01-09 21:41:17,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:17,382 INFO L124 PetriNetUnfolderBase]: 53/1303 cut-off events. [2025-01-09 21:41:17,383 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2025-01-09 21:41:17,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 1303 events. 53/1303 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3506 event pairs, 26 based on Foata normal form. 1/1195 useless extension candidates. Maximal degree in co-relation 1809. Up to 188 conditions per place. [2025-01-09 21:41:17,398 INFO L140 encePairwiseOnDemand]: 967/972 looper letters, 35 selfloop transitions, 2 changer transitions 1/256 dead transitions. [2025-01-09 21:41:17,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 256 transitions, 1289 flow [2025-01-09 21:41:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2467 transitions. [2025-01-09 21:41:17,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8460219478737997 [2025-01-09 21:41:17,400 INFO L175 Difference]: Start difference. First operand has 309 places, 259 transitions, 1221 flow. Second operand 3 states and 2467 transitions. [2025-01-09 21:41:17,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 256 transitions, 1289 flow [2025-01-09 21:41:17,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 256 transitions, 736 flow, removed 276 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:17,406 INFO L231 Difference]: Finished difference. Result has 309 places, 255 transitions, 664 flow [2025-01-09 21:41:17,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=972, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=309, PETRI_TRANSITIONS=255} [2025-01-09 21:41:17,406 INFO L279 CegarLoopForPetriNet]: 309 programPoint places, 0 predicate places. [2025-01-09 21:41:17,406 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 255 transitions, 664 flow [2025-01-09 21:41:17,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 810.3333333333334) internal successors, (2431), 3 states have internal predecessors, (2431), 0 states have call successors, (0), 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-01-09 21:41:17,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,407 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] [2025-01-09 21:41:17,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-01-09 21:41:17,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1350346423, now seen corresponding path program 1 times [2025-01-09 21:41:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-01-09 21:41:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34690175] [2025-01-09 21:41:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34690175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412423130] [2025-01-09 21:41:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:17,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:17,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:17,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:17,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 972 [2025-01-09 21:41:17,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 255 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 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-01-09 21:41:17,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:17,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 972 [2025-01-09 21:41:17,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:17,679 INFO L124 PetriNetUnfolderBase]: 27/1169 cut-off events. [2025-01-09 21:41:17,680 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-01-09 21:41:17,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 1169 events. 27/1169 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2586 event pairs, 0 based on Foata normal form. 26/1142 useless extension candidates. Maximal degree in co-relation 1412. Up to 135 conditions per place. [2025-01-09 21:41:17,691 INFO L140 encePairwiseOnDemand]: 966/972 looper letters, 33 selfloop transitions, 1 changer transitions 24/250 dead transitions. [2025-01-09 21:41:17,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 250 transitions, 726 flow [2025-01-09 21:41:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2312 transitions. [2025-01-09 21:41:17,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928669410150891 [2025-01-09 21:41:17,693 INFO L175 Difference]: Start difference. First operand has 309 places, 255 transitions, 664 flow. Second operand 3 states and 2312 transitions. [2025-01-09 21:41:17,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 250 transitions, 726 flow [2025-01-09 21:41:17,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 250 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:17,695 INFO L231 Difference]: Finished difference. Result has 303 places, 226 transitions, 602 flow [2025-01-09 21:41:17,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=972, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=303, PETRI_TRANSITIONS=226} [2025-01-09 21:41:17,696 INFO L279 CegarLoopForPetriNet]: 309 programPoint places, -6 predicate places. [2025-01-09 21:41:17,696 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 226 transitions, 602 flow [2025-01-09 21:41:17,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 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-01-09 21:41:17,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,697 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:17,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-01-09 21:41:17,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -777391011, now seen corresponding path program 1 times [2025-01-09 21:41:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521774921] [2025-01-09 21:41:17,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:17,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 21:41:17,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 21:41:17,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:17,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521774921] [2025-01-09 21:41:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521774921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622056] [2025-01-09 21:41:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:17,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:17,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:17,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 832 out of 972 [2025-01-09 21:41:17,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 226 transitions, 602 flow. Second operand has 5 states, 5 states have (on average 839.0) internal successors, (4195), 5 states have internal predecessors, (4195), 0 states have call successors, (0), 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-01-09 21:41:17,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:17,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 832 of 972 [2025-01-09 21:41:17,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:17,951 INFO L124 PetriNetUnfolderBase]: 0/558 cut-off events. [2025-01-09 21:41:17,953 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2025-01-09 21:41:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 558 events. 0/558 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 328 event pairs, 0 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 0. Up to 83 conditions per place. [2025-01-09 21:41:17,954 INFO L140 encePairwiseOnDemand]: 967/972 looper letters, 33 selfloop transitions, 2 changer transitions 3/228 dead transitions. [2025-01-09 21:41:17,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 228 transitions, 682 flow [2025-01-09 21:41:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4199 transitions. [2025-01-09 21:41:17,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8639917695473252 [2025-01-09 21:41:17,955 INFO L175 Difference]: Start difference. First operand has 303 places, 226 transitions, 602 flow. Second operand 5 states and 4199 transitions. [2025-01-09 21:41:17,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 228 transitions, 682 flow [2025-01-09 21:41:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 228 transitions, 681 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:17,958 INFO L231 Difference]: Finished difference. Result has 283 places, 225 transitions, 607 flow [2025-01-09 21:41:17,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=972, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=283, PETRI_TRANSITIONS=225} [2025-01-09 21:41:17,958 INFO L279 CegarLoopForPetriNet]: 309 programPoint places, -26 predicate places. [2025-01-09 21:41:17,958 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 225 transitions, 607 flow [2025-01-09 21:41:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 839.0) internal successors, (4195), 5 states have internal predecessors, (4195), 0 states have call successors, (0), 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-01-09 21:41:17,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:17,959 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-01-09 21:41:17,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:41:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1081203880, now seen corresponding path program 1 times [2025-01-09 21:41:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-01-09 21:41:17,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:41:18,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:41:18,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:18,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:41:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:41:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:18,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:18,119 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-01-09 21:41:18,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-01-09 21:41:18,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-01-09 21:41:18,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-01-09 21:41:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-01-09 21:41:18,121 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:18,122 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:18,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-01-09 21:41:18,222 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:18,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1033 places, 1008 transitions, 3524 flow [2025-01-09 21:41:18,519 INFO L124 PetriNetUnfolderBase]: 110/1732 cut-off events. [2025-01-09 21:41:18,520 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2025-01-09 21:41:18,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1732 events. 110/1732 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4959 event pairs, 0 based on Foata normal form. 0/1537 useless extension candidates. Maximal degree in co-relation 2163. Up to 54 conditions per place. [2025-01-09 21:41:18,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 1033 places, 1008 transitions, 3524 flow [2025-01-09 21:41:18,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 266 transitions, 1289 flow [2025-01-09 21:41:18,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:18,549 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:18,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-01-09 21:41:18,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:18,551 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:18,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:18,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:18,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:18,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:18,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 854932675, now seen corresponding path program 1 times [2025-01-09 21:41:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-01-09 21:41:18,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:18,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:18,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-01-09 21:41:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711101529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873384141] [2025-01-09 21:41:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:18,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:18,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 839 out of 1008 [2025-01-09 21:41:18,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 266 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 840.3333333333334) internal successors, (2521), 3 states have internal predecessors, (2521), 0 states have call successors, (0), 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-01-09 21:41:18,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:18,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 839 of 1008 [2025-01-09 21:41:18,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:18,934 INFO L124 PetriNetUnfolderBase]: 55/1352 cut-off events. [2025-01-09 21:41:18,935 INFO L125 PetriNetUnfolderBase]: For 3628/3628 co-relation queries the response was YES. [2025-01-09 21:41:18,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 1352 events. 55/1352 cut-off events. For 3628/3628 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 3505 event pairs, 27 based on Foata normal form. 1/1240 useless extension candidates. Maximal degree in co-relation 1893. Up to 195 conditions per place. [2025-01-09 21:41:18,950 INFO L140 encePairwiseOnDemand]: 1003/1008 looper letters, 36 selfloop transitions, 2 changer transitions 1/263 dead transitions. [2025-01-09 21:41:18,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 263 transitions, 1359 flow [2025-01-09 21:41:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2558 transitions. [2025-01-09 21:41:18,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8458994708994709 [2025-01-09 21:41:18,953 INFO L175 Difference]: Start difference. First operand has 318 places, 266 transitions, 1289 flow. Second operand 3 states and 2558 transitions. [2025-01-09 21:41:18,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 263 transitions, 1359 flow [2025-01-09 21:41:18,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 263 transitions, 758 flow, removed 300 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:18,959 INFO L231 Difference]: Finished difference. Result has 318 places, 262 transitions, 684 flow [2025-01-09 21:41:18,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1008, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=318, PETRI_TRANSITIONS=262} [2025-01-09 21:41:18,960 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 0 predicate places. [2025-01-09 21:41:18,960 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 262 transitions, 684 flow [2025-01-09 21:41:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 840.3333333333334) internal successors, (2521), 3 states have internal predecessors, (2521), 0 states have call successors, (0), 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-01-09 21:41:18,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:18,960 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] [2025-01-09 21:41:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-01-09 21:41:18,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 597083465, now seen corresponding path program 1 times [2025-01-09 21:41:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-01-09 21:41:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:18,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:18,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:18,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:18,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152189728] [2025-01-09 21:41:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152189728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-01-09 21:41:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:18,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:18,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:18,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:18,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:19,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 785 out of 1008 [2025-01-09 21:41:19,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 262 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 786.0) internal successors, (2358), 3 states have internal predecessors, (2358), 0 states have call successors, (0), 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-01-09 21:41:19,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:19,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 785 of 1008 [2025-01-09 21:41:19,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:19,259 INFO L124 PetriNetUnfolderBase]: 28/1213 cut-off events. [2025-01-09 21:41:19,259 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-01-09 21:41:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1213 events. 28/1213 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2634 event pairs, 0 based on Foata normal form. 27/1185 useless extension candidates. Maximal degree in co-relation 1466. Up to 140 conditions per place. [2025-01-09 21:41:19,270 INFO L140 encePairwiseOnDemand]: 1002/1008 looper letters, 34 selfloop transitions, 1 changer transitions 24/257 dead transitions. [2025-01-09 21:41:19,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 257 transitions, 748 flow [2025-01-09 21:41:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2397 transitions. [2025-01-09 21:41:19,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926587301587301 [2025-01-09 21:41:19,272 INFO L175 Difference]: Start difference. First operand has 318 places, 262 transitions, 684 flow. Second operand 3 states and 2397 transitions. [2025-01-09 21:41:19,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 257 transitions, 748 flow [2025-01-09 21:41:19,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 257 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:19,274 INFO L231 Difference]: Finished difference. Result has 312 places, 233 transitions, 622 flow [2025-01-09 21:41:19,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1008, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=312, PETRI_TRANSITIONS=233} [2025-01-09 21:41:19,275 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, -6 predicate places. [2025-01-09 21:41:19,275 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 233 transitions, 622 flow [2025-01-09 21:41:19,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 786.0) internal successors, (2358), 3 states have internal predecessors, (2358), 0 states have call successors, (0), 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-01-09 21:41:19,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,276 INFO L206 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:19,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-01-09 21:41:19,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:19,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1067605393, now seen corresponding path program 1 times [2025-01-09 21:41:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-01-09 21:41:19,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 21:41:19,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 21:41:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-01-09 21:41:19,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371051219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:19,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:19,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:19,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717750637] [2025-01-09 21:41:19,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:19,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:19,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:19,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:19,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 863 out of 1008 [2025-01-09 21:41:19,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 233 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 870.2) internal successors, (4351), 5 states have internal predecessors, (4351), 0 states have call successors, (0), 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-01-09 21:41:19,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:19,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 863 of 1008 [2025-01-09 21:41:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:19,532 INFO L124 PetriNetUnfolderBase]: 0/578 cut-off events. [2025-01-09 21:41:19,532 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-01-09 21:41:19,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 578 events. 0/578 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 338 event pairs, 0 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 0. Up to 86 conditions per place. [2025-01-09 21:41:19,533 INFO L140 encePairwiseOnDemand]: 1003/1008 looper letters, 34 selfloop transitions, 2 changer transitions 3/235 dead transitions. [2025-01-09 21:41:19,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 235 transitions, 704 flow [2025-01-09 21:41:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4355 transitions. [2025-01-09 21:41:19,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8640873015873016 [2025-01-09 21:41:19,538 INFO L175 Difference]: Start difference. First operand has 312 places, 233 transitions, 622 flow. Second operand 5 states and 4355 transitions. [2025-01-09 21:41:19,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 235 transitions, 704 flow [2025-01-09 21:41:19,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 235 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:19,540 INFO L231 Difference]: Finished difference. Result has 292 places, 232 transitions, 627 flow [2025-01-09 21:41:19,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1008, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=627, PETRI_PLACES=292, PETRI_TRANSITIONS=232} [2025-01-09 21:41:19,541 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, -26 predicate places. [2025-01-09 21:41:19,541 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 232 transitions, 627 flow [2025-01-09 21:41:19,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 870.2) internal successors, (4351), 5 states have internal predecessors, (4351), 0 states have call successors, (0), 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-01-09 21:41:19,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,541 INFO L206 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:19,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-01-09 21:41:19,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-01-09 21:41:19,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash 377894572, now seen corresponding path program 1 times [2025-01-09 21:41:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958394553] [2025-01-09 21:41:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:41:19,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:41:19,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:19,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:19,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 21:41:19,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 21:41:19,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:19,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:19,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:19,639 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:19,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2025-01-09 21:41:19,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2025-01-09 21:41:19,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2025-01-09 21:41:19,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2025-01-09 21:41:19,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-01-09 21:41:19,640 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:19,640 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:19,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-01-09 21:41:19,734 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:19,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1070 places, 1044 transitions, 3708 flow [2025-01-09 21:41:19,961 INFO L124 PetriNetUnfolderBase]: 114/1795 cut-off events. [2025-01-09 21:41:19,961 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2025-01-09 21:41:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 1795 events. 114/1795 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5090 event pairs, 0 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 2256. Up to 56 conditions per place. [2025-01-09 21:41:19,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 1070 places, 1044 transitions, 3708 flow [2025-01-09 21:41:19,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 273 transitions, 1359 flow [2025-01-09 21:41:19,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:19,986 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:19,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-01-09 21:41:19,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:19,987 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:19,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:19,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:19,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:19,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:19,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1564463299, now seen corresponding path program 1 times [2025-01-09 21:41:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:19,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559948024] [2025-01-09 21:41:19,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:20,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:20,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:20,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:20,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:20,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559948024] [2025-01-09 21:41:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559948024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671323923] [2025-01-09 21:41:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:20,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:20,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:20,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:20,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 869 out of 1044 [2025-01-09 21:41:20,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 273 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 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-01-09 21:41:20,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:20,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 869 of 1044 [2025-01-09 21:41:20,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:20,253 INFO L124 PetriNetUnfolderBase]: 57/1401 cut-off events. [2025-01-09 21:41:20,253 INFO L125 PetriNetUnfolderBase]: For 4033/4033 co-relation queries the response was YES. [2025-01-09 21:41:20,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1401 events. 57/1401 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3939 event pairs, 28 based on Foata normal form. 1/1285 useless extension candidates. Maximal degree in co-relation 1978. Up to 202 conditions per place. [2025-01-09 21:41:20,271 INFO L140 encePairwiseOnDemand]: 1039/1044 looper letters, 37 selfloop transitions, 2 changer transitions 1/270 dead transitions. [2025-01-09 21:41:20,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 270 transitions, 1431 flow [2025-01-09 21:41:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2649 transitions. [2025-01-09 21:41:20,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457854406130269 [2025-01-09 21:41:20,272 INFO L175 Difference]: Start difference. First operand has 327 places, 273 transitions, 1359 flow. Second operand 3 states and 2649 transitions. [2025-01-09 21:41:20,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 270 transitions, 1431 flow [2025-01-09 21:41:20,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 270 transitions, 780 flow, removed 325 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:20,279 INFO L231 Difference]: Finished difference. Result has 327 places, 269 transitions, 704 flow [2025-01-09 21:41:20,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1044, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=327, PETRI_TRANSITIONS=269} [2025-01-09 21:41:20,280 INFO L279 CegarLoopForPetriNet]: 327 programPoint places, 0 predicate places. [2025-01-09 21:41:20,280 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 269 transitions, 704 flow [2025-01-09 21:41:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 870.3333333333334) internal successors, (2611), 3 states have internal predecessors, (2611), 0 states have call successors, (0), 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-01-09 21:41:20,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:20,281 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] [2025-01-09 21:41:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-01-09 21:41:20,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1080147529, now seen corresponding path program 1 times [2025-01-09 21:41:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549884216] [2025-01-09 21:41:20,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:20,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549884216] [2025-01-09 21:41:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549884216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068934893] [2025-01-09 21:41:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:20,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:20,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:20,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 813 out of 1044 [2025-01-09 21:41:20,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 269 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 814.0) internal successors, (2442), 3 states have internal predecessors, (2442), 0 states have call successors, (0), 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-01-09 21:41:20,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:20,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 813 of 1044 [2025-01-09 21:41:20,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:20,516 INFO L124 PetriNetUnfolderBase]: 29/1257 cut-off events. [2025-01-09 21:41:20,516 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2025-01-09 21:41:20,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 1257 events. 29/1257 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 2926 event pairs, 0 based on Foata normal form. 28/1228 useless extension candidates. Maximal degree in co-relation 1520. Up to 145 conditions per place. [2025-01-09 21:41:20,528 INFO L140 encePairwiseOnDemand]: 1038/1044 looper letters, 35 selfloop transitions, 1 changer transitions 24/264 dead transitions. [2025-01-09 21:41:20,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 264 transitions, 770 flow [2025-01-09 21:41:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2482 transitions. [2025-01-09 21:41:20,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7924648786717752 [2025-01-09 21:41:20,529 INFO L175 Difference]: Start difference. First operand has 327 places, 269 transitions, 704 flow. Second operand 3 states and 2482 transitions. [2025-01-09 21:41:20,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 264 transitions, 770 flow [2025-01-09 21:41:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 264 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:20,532 INFO L231 Difference]: Finished difference. Result has 321 places, 240 transitions, 642 flow [2025-01-09 21:41:20,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1044, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=321, PETRI_TRANSITIONS=240} [2025-01-09 21:41:20,532 INFO L279 CegarLoopForPetriNet]: 327 programPoint places, -6 predicate places. [2025-01-09 21:41:20,532 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 240 transitions, 642 flow [2025-01-09 21:41:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 814.0) internal successors, (2442), 3 states have internal predecessors, (2442), 0 states have call successors, (0), 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-01-09 21:41:20,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:20,532 INFO L206 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:20,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-01-09 21:41:20,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1120784336, now seen corresponding path program 1 times [2025-01-09 21:41:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310879525] [2025-01-09 21:41:20,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:20,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 21:41:20,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 21:41:20,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310879525] [2025-01-09 21:41:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310879525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122822815] [2025-01-09 21:41:20,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:20,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:20,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 894 out of 1044 [2025-01-09 21:41:20,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 240 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 901.4) internal successors, (4507), 5 states have internal predecessors, (4507), 0 states have call successors, (0), 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-01-09 21:41:20,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:20,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 894 of 1044 [2025-01-09 21:41:20,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:20,838 INFO L124 PetriNetUnfolderBase]: 0/598 cut-off events. [2025-01-09 21:41:20,839 INFO L125 PetriNetUnfolderBase]: For 430/430 co-relation queries the response was YES. [2025-01-09 21:41:20,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 598 events. 0/598 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 352 event pairs, 0 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 0. Up to 89 conditions per place. [2025-01-09 21:41:20,839 INFO L140 encePairwiseOnDemand]: 1039/1044 looper letters, 35 selfloop transitions, 2 changer transitions 3/242 dead transitions. [2025-01-09 21:41:20,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 242 transitions, 726 flow [2025-01-09 21:41:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4511 transitions. [2025-01-09 21:41:20,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864176245210728 [2025-01-09 21:41:20,841 INFO L175 Difference]: Start difference. First operand has 321 places, 240 transitions, 642 flow. Second operand 5 states and 4511 transitions. [2025-01-09 21:41:20,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 242 transitions, 726 flow [2025-01-09 21:41:20,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 242 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:20,843 INFO L231 Difference]: Finished difference. Result has 301 places, 239 transitions, 647 flow [2025-01-09 21:41:20,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1044, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=647, PETRI_PLACES=301, PETRI_TRANSITIONS=239} [2025-01-09 21:41:20,844 INFO L279 CegarLoopForPetriNet]: 327 programPoint places, -26 predicate places. [2025-01-09 21:41:20,844 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 239 transitions, 647 flow [2025-01-09 21:41:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 901.4) internal successors, (4507), 5 states have internal predecessors, (4507), 0 states have call successors, (0), 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-01-09 21:41:20,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:20,844 INFO L206 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-01-09 21:41:20,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-01-09 21:41:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 994927607, now seen corresponding path program 1 times [2025-01-09 21:41:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-01-09 21:41:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:20,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 21:41:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 21:41:20,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:20,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:20,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 21:41:20,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 21:41:20,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:20,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:20,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:20,945 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:20,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-01-09 21:41:20,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-01-09 21:41:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-01-09 21:41:20,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-01-09 21:41:20,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:20,948 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:20,948 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-01-09 21:41:21,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:21,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1107 places, 1080 transitions, 3896 flow [2025-01-09 21:41:21,273 INFO L124 PetriNetUnfolderBase]: 118/1858 cut-off events. [2025-01-09 21:41:21,273 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2025-01-09 21:41:21,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 1858 events. 118/1858 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5202 event pairs, 0 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 2350. Up to 58 conditions per place. [2025-01-09 21:41:21,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 1107 places, 1080 transitions, 3896 flow [2025-01-09 21:41:21,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 280 transitions, 1431 flow [2025-01-09 21:41:21,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:21,294 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:21,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-09 21:41:21,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:21,294 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:21,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:21,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:21,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:21,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1255995197, now seen corresponding path program 1 times [2025-01-09 21:41:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-01-09 21:41:21,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:21,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:21,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537291620] [2025-01-09 21:41:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:21,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:21,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:21,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-01-09 21:41:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:21,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:21,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 899 out of 1080 [2025-01-09 21:41:21,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 280 transitions, 1431 flow. Second operand has 3 states, 3 states have (on average 900.3333333333334) internal successors, (2701), 3 states have internal predecessors, (2701), 0 states have call successors, (0), 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-01-09 21:41:21,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:21,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 899 of 1080 [2025-01-09 21:41:21,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:21,605 INFO L124 PetriNetUnfolderBase]: 59/1450 cut-off events. [2025-01-09 21:41:21,605 INFO L125 PetriNetUnfolderBase]: For 4467/4467 co-relation queries the response was YES. [2025-01-09 21:41:21,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1450 events. 59/1450 cut-off events. For 4467/4467 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 3921 event pairs, 29 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 2064. Up to 209 conditions per place. [2025-01-09 21:41:21,621 INFO L140 encePairwiseOnDemand]: 1075/1080 looper letters, 38 selfloop transitions, 2 changer transitions 1/277 dead transitions. [2025-01-09 21:41:21,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 277 transitions, 1505 flow [2025-01-09 21:41:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2740 transitions. [2025-01-09 21:41:21,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2025-01-09 21:41:21,623 INFO L175 Difference]: Start difference. First operand has 336 places, 280 transitions, 1431 flow. Second operand 3 states and 2740 transitions. [2025-01-09 21:41:21,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 277 transitions, 1505 flow [2025-01-09 21:41:21,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 277 transitions, 802 flow, removed 351 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:21,629 INFO L231 Difference]: Finished difference. Result has 336 places, 276 transitions, 724 flow [2025-01-09 21:41:21,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1080, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=336, PETRI_TRANSITIONS=276} [2025-01-09 21:41:21,629 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 0 predicate places. [2025-01-09 21:41:21,629 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 276 transitions, 724 flow [2025-01-09 21:41:21,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 900.3333333333334) internal successors, (2701), 3 states have internal predecessors, (2701), 0 states have call successors, (0), 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-01-09 21:41:21,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,630 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] [2025-01-09 21:41:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-01-09 21:41:21,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:21,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash 98845769, now seen corresponding path program 1 times [2025-01-09 21:41:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-01-09 21:41:21,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-01-09 21:41:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263896957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:21,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205541638] [2025-01-09 21:41:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:21,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:21,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:21,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 841 out of 1080 [2025-01-09 21:41:21,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 276 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 842.0) internal successors, (2526), 3 states have internal predecessors, (2526), 0 states have call successors, (0), 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-01-09 21:41:21,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:21,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 841 of 1080 [2025-01-09 21:41:21,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:21,890 INFO L124 PetriNetUnfolderBase]: 30/1301 cut-off events. [2025-01-09 21:41:21,890 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-01-09 21:41:21,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1301 events. 30/1301 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2892 event pairs, 0 based on Foata normal form. 29/1271 useless extension candidates. Maximal degree in co-relation 1574. Up to 150 conditions per place. [2025-01-09 21:41:21,905 INFO L140 encePairwiseOnDemand]: 1074/1080 looper letters, 36 selfloop transitions, 1 changer transitions 24/271 dead transitions. [2025-01-09 21:41:21,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 271 transitions, 792 flow [2025-01-09 21:41:21,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2567 transitions. [2025-01-09 21:41:21,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.792283950617284 [2025-01-09 21:41:21,906 INFO L175 Difference]: Start difference. First operand has 336 places, 276 transitions, 724 flow. Second operand 3 states and 2567 transitions. [2025-01-09 21:41:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 271 transitions, 792 flow [2025-01-09 21:41:21,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 271 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:21,909 INFO L231 Difference]: Finished difference. Result has 330 places, 247 transitions, 662 flow [2025-01-09 21:41:21,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1080, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=330, PETRI_TRANSITIONS=247} [2025-01-09 21:41:21,909 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, -6 predicate places. [2025-01-09 21:41:21,910 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 247 transitions, 662 flow [2025-01-09 21:41:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 842.0) internal successors, (2526), 3 states have internal predecessors, (2526), 0 states have call successors, (0), 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-01-09 21:41:21,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:21,910 INFO L206 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-01-09 21:41:21,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:21,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1737968698, now seen corresponding path program 1 times [2025-01-09 21:41:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923507808] [2025-01-09 21:41:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:21,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 21:41:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 21:41:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:22,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923507808] [2025-01-09 21:41:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923507808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:22,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666796419] [2025-01-09 21:41:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:22,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:22,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 925 out of 1080 [2025-01-09 21:41:22,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 247 transitions, 662 flow. Second operand has 5 states, 5 states have (on average 932.6) internal successors, (4663), 5 states have internal predecessors, (4663), 0 states have call successors, (0), 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-01-09 21:41:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 925 of 1080 [2025-01-09 21:41:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:22,218 INFO L124 PetriNetUnfolderBase]: 0/618 cut-off events. [2025-01-09 21:41:22,218 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-01-09 21:41:22,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 618 events. 0/618 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 362 event pairs, 0 based on Foata normal form. 1/618 useless extension candidates. Maximal degree in co-relation 0. Up to 92 conditions per place. [2025-01-09 21:41:22,218 INFO L140 encePairwiseOnDemand]: 1075/1080 looper letters, 36 selfloop transitions, 2 changer transitions 3/249 dead transitions. [2025-01-09 21:41:22,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 249 transitions, 748 flow [2025-01-09 21:41:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4667 transitions. [2025-01-09 21:41:22,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8642592592592593 [2025-01-09 21:41:22,220 INFO L175 Difference]: Start difference. First operand has 330 places, 247 transitions, 662 flow. Second operand 5 states and 4667 transitions. [2025-01-09 21:41:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 249 transitions, 748 flow [2025-01-09 21:41:22,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 249 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:22,223 INFO L231 Difference]: Finished difference. Result has 310 places, 246 transitions, 667 flow [2025-01-09 21:41:22,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1080, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=667, PETRI_PLACES=310, PETRI_TRANSITIONS=246} [2025-01-09 21:41:22,223 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, -26 predicate places. [2025-01-09 21:41:22,223 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 246 transitions, 667 flow [2025-01-09 21:41:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 932.6) internal successors, (4663), 5 states have internal predecessors, (4663), 0 states have call successors, (0), 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-01-09 21:41:22,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:22,223 INFO L206 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-01-09 21:41:22,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-01-09 21:41:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1838878327, now seen corresponding path program 1 times [2025-01-09 21:41:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890785270] [2025-01-09 21:41:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:22,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 21:41:22,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 21:41:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:22,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 21:41:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 21:41:22,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:22,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:22,336 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:22,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2025-01-09 21:41:22,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-01-09 21:41:22,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-01-09 21:41:22,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-01-09 21:41:22,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-01-09 21:41:22,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-01-09 21:41:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-01-09 21:41:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-01-09 21:41:22,338 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:22,339 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:22,339 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-01-09 21:41:22,438 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:22,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1144 places, 1116 transitions, 4088 flow [2025-01-09 21:41:22,698 INFO L124 PetriNetUnfolderBase]: 122/1921 cut-off events. [2025-01-09 21:41:22,698 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2025-01-09 21:41:22,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1921 events. 122/1921 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5481 event pairs, 0 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 2445. Up to 60 conditions per place. [2025-01-09 21:41:22,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 1144 places, 1116 transitions, 4088 flow [2025-01-09 21:41:22,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 287 transitions, 1505 flow [2025-01-09 21:41:22,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:22,723 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:22,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:41:22,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:22,724 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:22,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:22,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:22,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:22,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:22,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:22,725 INFO L85 PathProgramCache]: Analyzing trace with hash 983491779, now seen corresponding path program 1 times [2025-01-09 21:41:22,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:22,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108327596] [2025-01-09 21:41:22,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:22,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:22,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:22,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:22,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:22,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:22,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-01-09 21:41:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:22,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108327596] [2025-01-09 21:41:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108327596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108782451] [2025-01-09 21:41:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:22,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:22,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:22,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:22,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 929 out of 1116 [2025-01-09 21:41:22,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 287 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 930.3333333333334) internal successors, (2791), 3 states have internal predecessors, (2791), 0 states have call successors, (0), 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-01-09 21:41:22,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:22,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 929 of 1116 [2025-01-09 21:41:22,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:23,057 INFO L124 PetriNetUnfolderBase]: 61/1499 cut-off events. [2025-01-09 21:41:23,057 INFO L125 PetriNetUnfolderBase]: For 4931/4931 co-relation queries the response was YES. [2025-01-09 21:41:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 1499 events. 61/1499 cut-off events. For 4931/4931 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4080 event pairs, 30 based on Foata normal form. 1/1375 useless extension candidates. Maximal degree in co-relation 2151. Up to 216 conditions per place. [2025-01-09 21:41:23,077 INFO L140 encePairwiseOnDemand]: 1111/1116 looper letters, 39 selfloop transitions, 2 changer transitions 1/284 dead transitions. [2025-01-09 21:41:23,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 284 transitions, 1581 flow [2025-01-09 21:41:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2831 transitions. [2025-01-09 21:41:23,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8455794504181601 [2025-01-09 21:41:23,079 INFO L175 Difference]: Start difference. First operand has 345 places, 287 transitions, 1505 flow. Second operand 3 states and 2831 transitions. [2025-01-09 21:41:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 284 transitions, 1581 flow [2025-01-09 21:41:23,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 284 transitions, 824 flow, removed 378 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:23,086 INFO L231 Difference]: Finished difference. Result has 345 places, 283 transitions, 744 flow [2025-01-09 21:41:23,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1116, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=345, PETRI_TRANSITIONS=283} [2025-01-09 21:41:23,086 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, 0 predicate places. [2025-01-09 21:41:23,086 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 283 transitions, 744 flow [2025-01-09 21:41:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 930.3333333333334) internal successors, (2791), 3 states have internal predecessors, (2791), 0 states have call successors, (0), 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-01-09 21:41:23,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:23,087 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] [2025-01-09 21:41:23,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-01-09 21:41:23,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1948145481, now seen corresponding path program 1 times [2025-01-09 21:41:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148160969] [2025-01-09 21:41:23,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:23,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:23,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:23,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148160969] [2025-01-09 21:41:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148160969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:23,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733572860] [2025-01-09 21:41:23,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:23,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:23,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:23,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 869 out of 1116 [2025-01-09 21:41:23,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 283 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 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-01-09 21:41:23,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:23,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 869 of 1116 [2025-01-09 21:41:23,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:23,403 INFO L124 PetriNetUnfolderBase]: 31/1345 cut-off events. [2025-01-09 21:41:23,404 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-01-09 21:41:23,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1345 events. 31/1345 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 2993 event pairs, 0 based on Foata normal form. 30/1314 useless extension candidates. Maximal degree in co-relation 1628. Up to 155 conditions per place. [2025-01-09 21:41:23,419 INFO L140 encePairwiseOnDemand]: 1110/1116 looper letters, 37 selfloop transitions, 1 changer transitions 24/278 dead transitions. [2025-01-09 21:41:23,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 278 transitions, 814 flow [2025-01-09 21:41:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2652 transitions. [2025-01-09 21:41:23,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7921146953405018 [2025-01-09 21:41:23,420 INFO L175 Difference]: Start difference. First operand has 345 places, 283 transitions, 744 flow. Second operand 3 states and 2652 transitions. [2025-01-09 21:41:23,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 278 transitions, 814 flow [2025-01-09 21:41:23,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 278 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:23,423 INFO L231 Difference]: Finished difference. Result has 339 places, 254 transitions, 682 flow [2025-01-09 21:41:23,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1116, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=339, PETRI_TRANSITIONS=254} [2025-01-09 21:41:23,423 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -6 predicate places. [2025-01-09 21:41:23,423 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 254 transitions, 682 flow [2025-01-09 21:41:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 870.0) internal successors, (2610), 3 states have internal predecessors, (2610), 0 states have call successors, (0), 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-01-09 21:41:23,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:23,424 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:23,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-01-09 21:41:23,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:23,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1993072209, now seen corresponding path program 1 times [2025-01-09 21:41:23,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:23,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930512783] [2025-01-09 21:41:23,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:23,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-01-09 21:41:23,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-01-09 21:41:23,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930512783] [2025-01-09 21:41:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930512783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:23,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798904773] [2025-01-09 21:41:23,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:23,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:23,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:23,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:23,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 956 out of 1116 [2025-01-09 21:41:23,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 254 transitions, 682 flow. Second operand has 5 states, 5 states have (on average 963.8) internal successors, (4819), 5 states have internal predecessors, (4819), 0 states have call successors, (0), 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-01-09 21:41:23,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:23,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 956 of 1116 [2025-01-09 21:41:23,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:23,703 INFO L124 PetriNetUnfolderBase]: 0/638 cut-off events. [2025-01-09 21:41:23,703 INFO L125 PetriNetUnfolderBase]: For 491/491 co-relation queries the response was YES. [2025-01-09 21:41:23,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 638 events. 0/638 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 375 event pairs, 0 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 0. Up to 95 conditions per place. [2025-01-09 21:41:23,704 INFO L140 encePairwiseOnDemand]: 1111/1116 looper letters, 37 selfloop transitions, 2 changer transitions 3/256 dead transitions. [2025-01-09 21:41:23,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 256 transitions, 770 flow [2025-01-09 21:41:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4823 transitions. [2025-01-09 21:41:23,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864336917562724 [2025-01-09 21:41:23,706 INFO L175 Difference]: Start difference. First operand has 339 places, 254 transitions, 682 flow. Second operand 5 states and 4823 transitions. [2025-01-09 21:41:23,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 256 transitions, 770 flow [2025-01-09 21:41:23,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 256 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:23,709 INFO L231 Difference]: Finished difference. Result has 319 places, 253 transitions, 687 flow [2025-01-09 21:41:23,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1116, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=319, PETRI_TRANSITIONS=253} [2025-01-09 21:41:23,709 INFO L279 CegarLoopForPetriNet]: 345 programPoint places, -26 predicate places. [2025-01-09 21:41:23,709 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 253 transitions, 687 flow [2025-01-09 21:41:23,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 963.8) internal successors, (4819), 5 states have internal predecessors, (4819), 0 states have call successors, (0), 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-01-09 21:41:23,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:23,710 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-01-09 21:41:23,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:41:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1909883806, now seen corresponding path program 1 times [2025-01-09 21:41:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420725090] [2025-01-09 21:41:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:23,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 21:41:23,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 21:41:23,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:23,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:23,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 21:41:23,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 21:41:23,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:23,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:23,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:23,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-01-09 21:41:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-01-09 21:41:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-01-09 21:41:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-01-09 21:41:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-01-09 21:41:23,831 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:23,831 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:23,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-01-09 21:41:24,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:24,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1181 places, 1152 transitions, 4284 flow [2025-01-09 21:41:24,367 INFO L124 PetriNetUnfolderBase]: 126/1984 cut-off events. [2025-01-09 21:41:24,367 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2025-01-09 21:41:24,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 1984 events. 126/1984 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5641 event pairs, 0 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2541. Up to 62 conditions per place. [2025-01-09 21:41:24,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 1181 places, 1152 transitions, 4284 flow [2025-01-09 21:41:24,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 294 transitions, 1581 flow [2025-01-09 21:41:24,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:24,403 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:24,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:41:24,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:24,404 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:24,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:24,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:24,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:24,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -307010365, now seen corresponding path program 1 times [2025-01-09 21:41:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-01-09 21:41:24,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:24,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:24,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:24,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:24,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-01-09 21:41:24,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587925555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:24,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373357708] [2025-01-09 21:41:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:24,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:24,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:24,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:24,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 959 out of 1152 [2025-01-09 21:41:24,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 294 transitions, 1581 flow. Second operand has 3 states, 3 states have (on average 960.3333333333334) internal successors, (2881), 3 states have internal predecessors, (2881), 0 states have call successors, (0), 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-01-09 21:41:24,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:24,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 959 of 1152 [2025-01-09 21:41:24,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:24,827 INFO L124 PetriNetUnfolderBase]: 63/1548 cut-off events. [2025-01-09 21:41:24,827 INFO L125 PetriNetUnfolderBase]: For 5426/5426 co-relation queries the response was YES. [2025-01-09 21:41:24,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1548 events. 63/1548 cut-off events. For 5426/5426 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4044 event pairs, 31 based on Foata normal form. 1/1420 useless extension candidates. Maximal degree in co-relation 2239. Up to 223 conditions per place. [2025-01-09 21:41:24,848 INFO L140 encePairwiseOnDemand]: 1147/1152 looper letters, 40 selfloop transitions, 2 changer transitions 1/291 dead transitions. [2025-01-09 21:41:24,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 291 transitions, 1659 flow [2025-01-09 21:41:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2922 transitions. [2025-01-09 21:41:24,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8454861111111112 [2025-01-09 21:41:24,849 INFO L175 Difference]: Start difference. First operand has 354 places, 294 transitions, 1581 flow. Second operand 3 states and 2922 transitions. [2025-01-09 21:41:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 291 transitions, 1659 flow [2025-01-09 21:41:24,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 291 transitions, 846 flow, removed 406 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:24,856 INFO L231 Difference]: Finished difference. Result has 354 places, 290 transitions, 764 flow [2025-01-09 21:41:24,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1152, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=354, PETRI_TRANSITIONS=290} [2025-01-09 21:41:24,857 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, 0 predicate places. [2025-01-09 21:41:24,857 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 290 transitions, 764 flow [2025-01-09 21:41:24,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 960.3333333333334) internal successors, (2881), 3 states have internal predecessors, (2881), 0 states have call successors, (0), 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-01-09 21:41:24,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:24,857 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] [2025-01-09 21:41:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-01-09 21:41:24,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:24,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1961887927, now seen corresponding path program 1 times [2025-01-09 21:41:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860118259] [2025-01-09 21:41:24,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:24,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:24,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:24,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:24,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:24,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860118259] [2025-01-09 21:41:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860118259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303395392] [2025-01-09 21:41:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:24,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:24,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:24,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 897 out of 1152 [2025-01-09 21:41:24,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 290 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 898.0) internal successors, (2694), 3 states have internal predecessors, (2694), 0 states have call successors, (0), 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-01-09 21:41:24,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:24,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 897 of 1152 [2025-01-09 21:41:24,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:25,145 INFO L124 PetriNetUnfolderBase]: 32/1389 cut-off events. [2025-01-09 21:41:25,145 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-01-09 21:41:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1389 events. 32/1389 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3033 event pairs, 0 based on Foata normal form. 31/1357 useless extension candidates. Maximal degree in co-relation 1682. Up to 160 conditions per place. [2025-01-09 21:41:25,162 INFO L140 encePairwiseOnDemand]: 1146/1152 looper letters, 38 selfloop transitions, 1 changer transitions 24/285 dead transitions. [2025-01-09 21:41:25,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 285 transitions, 836 flow [2025-01-09 21:41:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2737 transitions. [2025-01-09 21:41:25,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7919560185185185 [2025-01-09 21:41:25,164 INFO L175 Difference]: Start difference. First operand has 354 places, 290 transitions, 764 flow. Second operand 3 states and 2737 transitions. [2025-01-09 21:41:25,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 285 transitions, 836 flow [2025-01-09 21:41:25,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 285 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:25,167 INFO L231 Difference]: Finished difference. Result has 348 places, 261 transitions, 702 flow [2025-01-09 21:41:25,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1152, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=348, PETRI_TRANSITIONS=261} [2025-01-09 21:41:25,167 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -6 predicate places. [2025-01-09 21:41:25,167 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 261 transitions, 702 flow [2025-01-09 21:41:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 898.0) internal successors, (2694), 3 states have internal predecessors, (2694), 0 states have call successors, (0), 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-01-09 21:41:25,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:25,168 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-01-09 21:41:25,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -962613105, now seen corresponding path program 1 times [2025-01-09 21:41:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208655506] [2025-01-09 21:41:25,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:25,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 21:41:25,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 21:41:25,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:25,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:25,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-01-09 21:41:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208655506] [2025-01-09 21:41:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208655506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836513397] [2025-01-09 21:41:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:25,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:25,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:25,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:25,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1152 [2025-01-09 21:41:25,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 261 transitions, 702 flow. Second operand has 5 states, 5 states have (on average 995.0) internal successors, (4975), 5 states have internal predecessors, (4975), 0 states have call successors, (0), 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-01-09 21:41:25,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:25,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1152 [2025-01-09 21:41:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:25,477 INFO L124 PetriNetUnfolderBase]: 0/658 cut-off events. [2025-01-09 21:41:25,478 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES. [2025-01-09 21:41:25,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 658 events. 0/658 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 387 event pairs, 0 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 0. Up to 98 conditions per place. [2025-01-09 21:41:25,478 INFO L140 encePairwiseOnDemand]: 1147/1152 looper letters, 38 selfloop transitions, 2 changer transitions 3/263 dead transitions. [2025-01-09 21:41:25,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 263 transitions, 792 flow [2025-01-09 21:41:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4979 transitions. [2025-01-09 21:41:25,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8644097222222222 [2025-01-09 21:41:25,480 INFO L175 Difference]: Start difference. First operand has 348 places, 261 transitions, 702 flow. Second operand 5 states and 4979 transitions. [2025-01-09 21:41:25,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 263 transitions, 792 flow [2025-01-09 21:41:25,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 263 transitions, 791 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:25,483 INFO L231 Difference]: Finished difference. Result has 328 places, 260 transitions, 707 flow [2025-01-09 21:41:25,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1152, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=707, PETRI_PLACES=328, PETRI_TRANSITIONS=260} [2025-01-09 21:41:25,483 INFO L279 CegarLoopForPetriNet]: 354 programPoint places, -26 predicate places. [2025-01-09 21:41:25,483 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 260 transitions, 707 flow [2025-01-09 21:41:25,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 995.0) internal successors, (4975), 5 states have internal predecessors, (4975), 0 states have call successors, (0), 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-01-09 21:41:25,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:25,484 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:25,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-01-09 21:41:25,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:41:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1943621246, now seen corresponding path program 1 times [2025-01-09 21:41:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:25,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802231450] [2025-01-09 21:41:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:25,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:25,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 21:41:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 21:41:25,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:25,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:25,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 21:41:25,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 21:41:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:25,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:25,608 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:25,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-01-09 21:41:25,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-01-09 21:41:25,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-01-09 21:41:25,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-01-09 21:41:25,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-01-09 21:41:25,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-01-09 21:41:25,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-01-09 21:41:25,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-01-09 21:41:25,611 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:25,611 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:25,611 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-01-09 21:41:25,693 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1218 places, 1188 transitions, 4484 flow [2025-01-09 21:41:25,990 INFO L124 PetriNetUnfolderBase]: 130/2047 cut-off events. [2025-01-09 21:41:25,990 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2025-01-09 21:41:26,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 2047 events. 130/2047 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5804 event pairs, 0 based on Foata normal form. 0/1817 useless extension candidates. Maximal degree in co-relation 2638. Up to 64 conditions per place. [2025-01-09 21:41:26,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 1218 places, 1188 transitions, 4484 flow [2025-01-09 21:41:26,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 363 places, 301 transitions, 1659 flow [2025-01-09 21:41:26,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:26,020 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:26,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 21:41:26,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:26,020 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:26,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:26,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:26,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash -832534333, now seen corresponding path program 1 times [2025-01-09 21:41:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-01-09 21:41:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:26,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:26,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:26,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-01-09 21:41:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263028662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607944916] [2025-01-09 21:41:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:26,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:26,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:26,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:26,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 989 out of 1188 [2025-01-09 21:41:26,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 301 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 990.3333333333334) internal successors, (2971), 3 states have internal predecessors, (2971), 0 states have call successors, (0), 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-01-09 21:41:26,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:26,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 989 of 1188 [2025-01-09 21:41:26,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:26,367 INFO L124 PetriNetUnfolderBase]: 65/1597 cut-off events. [2025-01-09 21:41:26,367 INFO L125 PetriNetUnfolderBase]: For 5953/5953 co-relation queries the response was YES. [2025-01-09 21:41:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 1597 events. 65/1597 cut-off events. For 5953/5953 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4187 event pairs, 32 based on Foata normal form. 1/1465 useless extension candidates. Maximal degree in co-relation 2328. Up to 230 conditions per place. [2025-01-09 21:41:26,390 INFO L140 encePairwiseOnDemand]: 1183/1188 looper letters, 41 selfloop transitions, 2 changer transitions 1/298 dead transitions. [2025-01-09 21:41:26,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 298 transitions, 1739 flow [2025-01-09 21:41:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3013 transitions. [2025-01-09 21:41:26,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453984287317621 [2025-01-09 21:41:26,392 INFO L175 Difference]: Start difference. First operand has 363 places, 301 transitions, 1659 flow. Second operand 3 states and 3013 transitions. [2025-01-09 21:41:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 298 transitions, 1739 flow [2025-01-09 21:41:26,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 298 transitions, 868 flow, removed 435 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:26,400 INFO L231 Difference]: Finished difference. Result has 363 places, 297 transitions, 784 flow [2025-01-09 21:41:26,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1188, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=363, PETRI_TRANSITIONS=297} [2025-01-09 21:41:26,400 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, 0 predicate places. [2025-01-09 21:41:26,400 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 297 transitions, 784 flow [2025-01-09 21:41:26,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 990.3333333333334) internal successors, (2971), 3 states have internal predecessors, (2971), 0 states have call successors, (0), 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-01-09 21:41:26,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,401 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] [2025-01-09 21:41:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-01-09 21:41:26,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1253647433, now seen corresponding path program 1 times [2025-01-09 21:41:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936550621] [2025-01-09 21:41:26,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:26,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:26,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:26,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:26,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936550621] [2025-01-09 21:41:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936550621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489449727] [2025-01-09 21:41:26,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:26,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:26,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:26,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:26,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:26,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 925 out of 1188 [2025-01-09 21:41:26,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 297 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 926.0) internal successors, (2778), 3 states have internal predecessors, (2778), 0 states have call successors, (0), 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-01-09 21:41:26,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:26,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 925 of 1188 [2025-01-09 21:41:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:26,688 INFO L124 PetriNetUnfolderBase]: 33/1433 cut-off events. [2025-01-09 21:41:26,688 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2025-01-09 21:41:26,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 1433 events. 33/1433 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3133 event pairs, 0 based on Foata normal form. 32/1400 useless extension candidates. Maximal degree in co-relation 1736. Up to 165 conditions per place. [2025-01-09 21:41:26,707 INFO L140 encePairwiseOnDemand]: 1182/1188 looper letters, 39 selfloop transitions, 1 changer transitions 24/292 dead transitions. [2025-01-09 21:41:26,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 292 transitions, 858 flow [2025-01-09 21:41:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2822 transitions. [2025-01-09 21:41:26,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7918069584736251 [2025-01-09 21:41:26,708 INFO L175 Difference]: Start difference. First operand has 363 places, 297 transitions, 784 flow. Second operand 3 states and 2822 transitions. [2025-01-09 21:41:26,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 292 transitions, 858 flow [2025-01-09 21:41:26,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 292 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:26,711 INFO L231 Difference]: Finished difference. Result has 357 places, 268 transitions, 722 flow [2025-01-09 21:41:26,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1188, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=357, PETRI_TRANSITIONS=268} [2025-01-09 21:41:26,711 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -6 predicate places. [2025-01-09 21:41:26,711 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 268 transitions, 722 flow [2025-01-09 21:41:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 926.0) internal successors, (2778), 3 states have internal predecessors, (2778), 0 states have call successors, (0), 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-01-09 21:41:26,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:26,712 INFO L206 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:26,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-01-09 21:41:26,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:26,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1823836378, now seen corresponding path program 1 times [2025-01-09 21:41:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-01-09 21:41:26,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-09 21:41:26,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-09 21:41:26,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:26,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:26,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:26,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143104084] [2025-01-09 21:41:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143104084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:26,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:26,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:26,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974032068] [2025-01-09 21:41:26,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:26,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:26,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:26,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:26,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1018 out of 1188 [2025-01-09 21:41:26,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 268 transitions, 722 flow. Second operand has 5 states, 5 states have (on average 1026.2) internal successors, (5131), 5 states have internal predecessors, (5131), 0 states have call successors, (0), 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-01-09 21:41:26,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:26,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1018 of 1188 [2025-01-09 21:41:26,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:27,021 INFO L124 PetriNetUnfolderBase]: 0/678 cut-off events. [2025-01-09 21:41:27,022 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-01-09 21:41:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 678 events. 0/678 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 399 event pairs, 0 based on Foata normal form. 1/678 useless extension candidates. Maximal degree in co-relation 0. Up to 101 conditions per place. [2025-01-09 21:41:27,022 INFO L140 encePairwiseOnDemand]: 1183/1188 looper letters, 39 selfloop transitions, 2 changer transitions 3/270 dead transitions. [2025-01-09 21:41:27,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 270 transitions, 814 flow [2025-01-09 21:41:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5135 transitions. [2025-01-09 21:41:27,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8644781144781145 [2025-01-09 21:41:27,024 INFO L175 Difference]: Start difference. First operand has 357 places, 268 transitions, 722 flow. Second operand 5 states and 5135 transitions. [2025-01-09 21:41:27,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 270 transitions, 814 flow [2025-01-09 21:41:27,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 270 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:27,027 INFO L231 Difference]: Finished difference. Result has 337 places, 267 transitions, 727 flow [2025-01-09 21:41:27,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1188, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=727, PETRI_PLACES=337, PETRI_TRANSITIONS=267} [2025-01-09 21:41:27,027 INFO L279 CegarLoopForPetriNet]: 363 programPoint places, -26 predicate places. [2025-01-09 21:41:27,027 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 267 transitions, 727 flow [2025-01-09 21:41:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1026.2) internal successors, (5131), 5 states have internal predecessors, (5131), 0 states have call successors, (0), 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-01-09 21:41:27,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:27,028 INFO L206 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:27,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-01-09 21:41:27,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-01-09 21:41:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1232646679, now seen corresponding path program 1 times [2025-01-09 21:41:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609217854] [2025-01-09 21:41:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:27,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 21:41:27,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 21:41:27,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:27,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:27,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:27,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 21:41:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 21:41:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:27,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:27,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-01-09 21:41:27,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-01-09 21:41:27,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-01-09 21:41:27,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-01-09 21:41:27,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-01-09 21:41:27,164 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:27,164 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:27,164 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-01-09 21:41:27,256 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:27,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1255 places, 1224 transitions, 4688 flow [2025-01-09 21:41:27,579 INFO L124 PetriNetUnfolderBase]: 134/2110 cut-off events. [2025-01-09 21:41:27,579 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2025-01-09 21:41:27,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 2110 events. 134/2110 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6103 event pairs, 0 based on Foata normal form. 0/1873 useless extension candidates. Maximal degree in co-relation 2736. Up to 66 conditions per place. [2025-01-09 21:41:27,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 1255 places, 1224 transitions, 4688 flow [2025-01-09 21:41:27,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 372 places, 308 transitions, 1739 flow [2025-01-09 21:41:27,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:27,612 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:27,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 21:41:27,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:27,613 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:27,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:27,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:27,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:27,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:27,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -593080125, now seen corresponding path program 1 times [2025-01-09 21:41:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:27,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-01-09 21:41:27,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:27,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:27,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:27,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-01-09 21:41:27,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645484495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:27,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:27,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313205626] [2025-01-09 21:41:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:27,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:27,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:27,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1019 out of 1224 [2025-01-09 21:41:27,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 308 transitions, 1739 flow. Second operand has 3 states, 3 states have (on average 1020.3333333333334) internal successors, (3061), 3 states have internal predecessors, (3061), 0 states have call successors, (0), 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-01-09 21:41:27,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:27,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1019 of 1224 [2025-01-09 21:41:27,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:27,976 INFO L124 PetriNetUnfolderBase]: 67/1646 cut-off events. [2025-01-09 21:41:27,976 INFO L125 PetriNetUnfolderBase]: For 6513/6513 co-relation queries the response was YES. [2025-01-09 21:41:27,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2545 conditions, 1646 events. 67/1646 cut-off events. For 6513/6513 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 4334 event pairs, 33 based on Foata normal form. 1/1510 useless extension candidates. Maximal degree in co-relation 2418. Up to 237 conditions per place. [2025-01-09 21:41:28,000 INFO L140 encePairwiseOnDemand]: 1219/1224 looper letters, 42 selfloop transitions, 2 changer transitions 1/305 dead transitions. [2025-01-09 21:41:28,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 305 transitions, 1821 flow [2025-01-09 21:41:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3104 transitions. [2025-01-09 21:41:28,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8453159041394336 [2025-01-09 21:41:28,002 INFO L175 Difference]: Start difference. First operand has 372 places, 308 transitions, 1739 flow. Second operand 3 states and 3104 transitions. [2025-01-09 21:41:28,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 305 transitions, 1821 flow [2025-01-09 21:41:28,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 305 transitions, 890 flow, removed 465 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:28,010 INFO L231 Difference]: Finished difference. Result has 372 places, 304 transitions, 804 flow [2025-01-09 21:41:28,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1224, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=372, PETRI_TRANSITIONS=304} [2025-01-09 21:41:28,011 INFO L279 CegarLoopForPetriNet]: 372 programPoint places, 0 predicate places. [2025-01-09 21:41:28,011 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 304 transitions, 804 flow [2025-01-09 21:41:28,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1020.3333333333334) internal successors, (3061), 3 states have internal predecessors, (3061), 0 states have call successors, (0), 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-01-09 21:41:28,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:28,011 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] [2025-01-09 21:41:28,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-01-09 21:41:28,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:28,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1290150327, now seen corresponding path program 1 times [2025-01-09 21:41:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489914] [2025-01-09 21:41:28,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:28,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:28,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:28,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489914] [2025-01-09 21:41:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491538357] [2025-01-09 21:41:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:28,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 953 out of 1224 [2025-01-09 21:41:28,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 304 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 954.0) internal successors, (2862), 3 states have internal predecessors, (2862), 0 states have call successors, (0), 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-01-09 21:41:28,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:28,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 953 of 1224 [2025-01-09 21:41:28,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:28,311 INFO L124 PetriNetUnfolderBase]: 34/1477 cut-off events. [2025-01-09 21:41:28,311 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-01-09 21:41:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1477 events. 34/1477 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3233 event pairs, 0 based on Foata normal form. 33/1443 useless extension candidates. Maximal degree in co-relation 1790. Up to 170 conditions per place. [2025-01-09 21:41:28,329 INFO L140 encePairwiseOnDemand]: 1218/1224 looper letters, 40 selfloop transitions, 1 changer transitions 24/299 dead transitions. [2025-01-09 21:41:28,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 299 transitions, 880 flow [2025-01-09 21:41:28,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2907 transitions. [2025-01-09 21:41:28,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2025-01-09 21:41:28,331 INFO L175 Difference]: Start difference. First operand has 372 places, 304 transitions, 804 flow. Second operand 3 states and 2907 transitions. [2025-01-09 21:41:28,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 299 transitions, 880 flow [2025-01-09 21:41:28,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 299 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:28,334 INFO L231 Difference]: Finished difference. Result has 366 places, 275 transitions, 742 flow [2025-01-09 21:41:28,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1224, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=366, PETRI_TRANSITIONS=275} [2025-01-09 21:41:28,334 INFO L279 CegarLoopForPetriNet]: 372 programPoint places, -6 predicate places. [2025-01-09 21:41:28,334 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 275 transitions, 742 flow [2025-01-09 21:41:28,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 954.0) internal successors, (2862), 3 states have internal predecessors, (2862), 0 states have call successors, (0), 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-01-09 21:41:28,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:28,334 INFO L206 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:28,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-01-09 21:41:28,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -542782832, now seen corresponding path program 1 times [2025-01-09 21:41:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-01-09 21:41:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:28,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 21:41:28,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 21:41:28,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-01-09 21:41:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645408295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:28,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421448230] [2025-01-09 21:41:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:28,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:28,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:28,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1224 [2025-01-09 21:41:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 275 transitions, 742 flow. Second operand has 5 states, 5 states have (on average 1057.4) internal successors, (5287), 5 states have internal predecessors, (5287), 0 states have call successors, (0), 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-01-09 21:41:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:28,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1224 [2025-01-09 21:41:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:28,689 INFO L124 PetriNetUnfolderBase]: 0/698 cut-off events. [2025-01-09 21:41:28,689 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2025-01-09 21:41:28,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 698 events. 0/698 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 411 event pairs, 0 based on Foata normal form. 1/698 useless extension candidates. Maximal degree in co-relation 0. Up to 104 conditions per place. [2025-01-09 21:41:28,690 INFO L140 encePairwiseOnDemand]: 1219/1224 looper letters, 40 selfloop transitions, 2 changer transitions 3/277 dead transitions. [2025-01-09 21:41:28,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 277 transitions, 836 flow [2025-01-09 21:41:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5291 transitions. [2025-01-09 21:41:28,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8645424836601308 [2025-01-09 21:41:28,691 INFO L175 Difference]: Start difference. First operand has 366 places, 275 transitions, 742 flow. Second operand 5 states and 5291 transitions. [2025-01-09 21:41:28,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 277 transitions, 836 flow [2025-01-09 21:41:28,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 277 transitions, 835 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:28,694 INFO L231 Difference]: Finished difference. Result has 346 places, 274 transitions, 747 flow [2025-01-09 21:41:28,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1224, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=346, PETRI_TRANSITIONS=274} [2025-01-09 21:41:28,695 INFO L279 CegarLoopForPetriNet]: 372 programPoint places, -26 predicate places. [2025-01-09 21:41:28,695 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 274 transitions, 747 flow [2025-01-09 21:41:28,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1057.4) internal successors, (5287), 5 states have internal predecessors, (5287), 0 states have call successors, (0), 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-01-09 21:41:28,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:28,695 INFO L206 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:28,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-01-09 21:41:28,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-01-09 21:41:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1787109015, now seen corresponding path program 1 times [2025-01-09 21:41:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907139781] [2025-01-09 21:41:28,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-01-09 21:41:28,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-01-09 21:41:28,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:28,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:28,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-01-09 21:41:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-01-09 21:41:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:28,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:28,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-01-09 21:41:28,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-01-09 21:41:28,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-01-09 21:41:28,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-01-09 21:41:28,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-01-09 21:41:28,840 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:28,840 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:28,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-01-09 21:41:28,989 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:28,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1292 places, 1260 transitions, 4896 flow [2025-01-09 21:41:29,273 INFO L124 PetriNetUnfolderBase]: 138/2173 cut-off events. [2025-01-09 21:41:29,273 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2025-01-09 21:41:29,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 2173 events. 138/2173 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6164 event pairs, 0 based on Foata normal form. 0/1929 useless extension candidates. Maximal degree in co-relation 2835. Up to 68 conditions per place. [2025-01-09 21:41:29,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 1292 places, 1260 transitions, 4896 flow [2025-01-09 21:41:29,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 381 places, 315 transitions, 1821 flow [2025-01-09 21:41:29,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:29,314 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:29,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-01-09 21:41:29,315 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:29,315 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:29,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:29,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:29,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:29,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash 411352259, now seen corresponding path program 1 times [2025-01-09 21:41:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434116129] [2025-01-09 21:41:29,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:29,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:29,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:29,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:29,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434116129] [2025-01-09 21:41:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434116129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699099369] [2025-01-09 21:41:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:29,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1260 [2025-01-09 21:41:29,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 315 transitions, 1821 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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-01-09 21:41:29,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:29,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1260 [2025-01-09 21:41:29,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:29,718 INFO L124 PetriNetUnfolderBase]: 69/1695 cut-off events. [2025-01-09 21:41:29,718 INFO L125 PetriNetUnfolderBase]: For 7107/7107 co-relation queries the response was YES. [2025-01-09 21:41:29,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1695 events. 69/1695 cut-off events. For 7107/7107 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4639 event pairs, 34 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 2509. Up to 244 conditions per place. [2025-01-09 21:41:29,743 INFO L140 encePairwiseOnDemand]: 1255/1260 looper letters, 43 selfloop transitions, 2 changer transitions 1/312 dead transitions. [2025-01-09 21:41:29,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 312 transitions, 1905 flow [2025-01-09 21:41:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3195 transitions. [2025-01-09 21:41:29,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-01-09 21:41:29,745 INFO L175 Difference]: Start difference. First operand has 381 places, 315 transitions, 1821 flow. Second operand 3 states and 3195 transitions. [2025-01-09 21:41:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 312 transitions, 1905 flow [2025-01-09 21:41:29,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 312 transitions, 912 flow, removed 496 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:29,755 INFO L231 Difference]: Finished difference. Result has 381 places, 311 transitions, 824 flow [2025-01-09 21:41:29,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1260, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=381, PETRI_TRANSITIONS=311} [2025-01-09 21:41:29,756 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, 0 predicate places. [2025-01-09 21:41:29,756 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 311 transitions, 824 flow [2025-01-09 21:41:29,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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-01-09 21:41:29,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:29,756 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] [2025-01-09 21:41:29,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-01-09 21:41:29,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:29,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1003346615, now seen corresponding path program 1 times [2025-01-09 21:41:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:29,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003042079] [2025-01-09 21:41:29,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:29,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:29,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:29,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:29,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003042079] [2025-01-09 21:41:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003042079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549318819] [2025-01-09 21:41:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:29,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1260 [2025-01-09 21:41:29,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 311 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 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-01-09 21:41:29,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:29,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1260 [2025-01-09 21:41:29,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:30,083 INFO L124 PetriNetUnfolderBase]: 35/1521 cut-off events. [2025-01-09 21:41:30,083 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2025-01-09 21:41:30,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 1521 events. 35/1521 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3403 event pairs, 0 based on Foata normal form. 34/1486 useless extension candidates. Maximal degree in co-relation 1844. Up to 175 conditions per place. [2025-01-09 21:41:30,102 INFO L140 encePairwiseOnDemand]: 1254/1260 looper letters, 41 selfloop transitions, 1 changer transitions 24/306 dead transitions. [2025-01-09 21:41:30,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 306 transitions, 902 flow [2025-01-09 21:41:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2992 transitions. [2025-01-09 21:41:30,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2025-01-09 21:41:30,104 INFO L175 Difference]: Start difference. First operand has 381 places, 311 transitions, 824 flow. Second operand 3 states and 2992 transitions. [2025-01-09 21:41:30,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 306 transitions, 902 flow [2025-01-09 21:41:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 306 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:30,106 INFO L231 Difference]: Finished difference. Result has 375 places, 282 transitions, 762 flow [2025-01-09 21:41:30,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1260, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=375, PETRI_TRANSITIONS=282} [2025-01-09 21:41:30,107 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -6 predicate places. [2025-01-09 21:41:30,107 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 282 transitions, 762 flow [2025-01-09 21:41:30,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 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-01-09 21:41:30,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:30,107 INFO L206 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:30,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-01-09 21:41:30,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 721757617, now seen corresponding path program 1 times [2025-01-09 21:41:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-01-09 21:41:30,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:30,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 21:41:30,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 21:41:30,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-01-09 21:41:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844225801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:30,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561271069] [2025-01-09 21:41:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:30,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:30,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:30,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1080 out of 1260 [2025-01-09 21:41:30,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 282 transitions, 762 flow. Second operand has 5 states, 5 states have (on average 1088.6) internal successors, (5443), 5 states have internal predecessors, (5443), 0 states have call successors, (0), 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-01-09 21:41:30,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:30,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1080 of 1260 [2025-01-09 21:41:30,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:30,498 INFO L124 PetriNetUnfolderBase]: 0/718 cut-off events. [2025-01-09 21:41:30,498 INFO L125 PetriNetUnfolderBase]: For 625/625 co-relation queries the response was YES. [2025-01-09 21:41:30,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 718 events. 0/718 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 423 event pairs, 0 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 0. Up to 107 conditions per place. [2025-01-09 21:41:30,499 INFO L140 encePairwiseOnDemand]: 1255/1260 looper letters, 41 selfloop transitions, 2 changer transitions 3/284 dead transitions. [2025-01-09 21:41:30,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 284 transitions, 858 flow [2025-01-09 21:41:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5447 transitions. [2025-01-09 21:41:30,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8646031746031746 [2025-01-09 21:41:30,501 INFO L175 Difference]: Start difference. First operand has 375 places, 282 transitions, 762 flow. Second operand 5 states and 5447 transitions. [2025-01-09 21:41:30,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 284 transitions, 858 flow [2025-01-09 21:41:30,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 284 transitions, 857 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:30,504 INFO L231 Difference]: Finished difference. Result has 355 places, 281 transitions, 767 flow [2025-01-09 21:41:30,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1260, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=767, PETRI_PLACES=355, PETRI_TRANSITIONS=281} [2025-01-09 21:41:30,504 INFO L279 CegarLoopForPetriNet]: 381 programPoint places, -26 predicate places. [2025-01-09 21:41:30,504 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 281 transitions, 767 flow [2025-01-09 21:41:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1088.6) internal successors, (5443), 5 states have internal predecessors, (5443), 0 states have call successors, (0), 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-01-09 21:41:30,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:30,505 INFO L206 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-01-09 21:41:30,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-01-09 21:41:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 601424012, now seen corresponding path program 1 times [2025-01-09 21:41:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286551785] [2025-01-09 21:41:30,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:30,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 21:41:30,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 21:41:30,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:30,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:30,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-01-09 21:41:30,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-01-09 21:41:30,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:30,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:30,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:30,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:30,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2025-01-09 21:41:30,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 41 remaining) [2025-01-09 21:41:30,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 41 remaining) [2025-01-09 21:41:30,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 41 remaining) [2025-01-09 21:41:30,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 41 remaining) [2025-01-09 21:41:30,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 41 remaining) [2025-01-09 21:41:30,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 41 remaining) [2025-01-09 21:41:30,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 41 remaining) [2025-01-09 21:41:30,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 41 remaining) [2025-01-09 21:41:30,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 41 remaining) [2025-01-09 21:41:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-01-09 21:41:30,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:30,781 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:30,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-01-09 21:41:30,902 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:30,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1329 places, 1296 transitions, 5108 flow [2025-01-09 21:41:31,355 INFO L124 PetriNetUnfolderBase]: 142/2236 cut-off events. [2025-01-09 21:41:31,355 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2025-01-09 21:41:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 2236 events. 142/2236 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6406 event pairs, 0 based on Foata normal form. 0/1985 useless extension candidates. Maximal degree in co-relation 2935. Up to 70 conditions per place. [2025-01-09 21:41:31,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 1329 places, 1296 transitions, 5108 flow [2025-01-09 21:41:31,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 390 places, 322 transitions, 1905 flow [2025-01-09 21:41:31,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:31,397 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:31,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-09 21:41:31,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:31,398 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:31,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:31,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:31,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:31,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:31,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2114204477, now seen corresponding path program 1 times [2025-01-09 21:41:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-01-09 21:41:31,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:31,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:31,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:31,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:31,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:31,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:31,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-01-09 21:41:31,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941160051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366642007] [2025-01-09 21:41:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:31,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:31,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:31,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1296 [2025-01-09 21:41:31,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 322 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 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-01-09 21:41:31,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:31,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1296 [2025-01-09 21:41:31,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:31,812 INFO L124 PetriNetUnfolderBase]: 71/1744 cut-off events. [2025-01-09 21:41:31,812 INFO L125 PetriNetUnfolderBase]: For 7736/7736 co-relation queries the response was YES. [2025-01-09 21:41:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 1744 events. 71/1744 cut-off events. For 7736/7736 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4767 event pairs, 35 based on Foata normal form. 1/1600 useless extension candidates. Maximal degree in co-relation 2601. Up to 251 conditions per place. [2025-01-09 21:41:31,840 INFO L140 encePairwiseOnDemand]: 1291/1296 looper letters, 44 selfloop transitions, 2 changer transitions 1/319 dead transitions. [2025-01-09 21:41:31,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 319 transitions, 1991 flow [2025-01-09 21:41:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3286 transitions. [2025-01-09 21:41:31,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845164609053498 [2025-01-09 21:41:31,842 INFO L175 Difference]: Start difference. First operand has 390 places, 322 transitions, 1905 flow. Second operand 3 states and 3286 transitions. [2025-01-09 21:41:31,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 319 transitions, 1991 flow [2025-01-09 21:41:31,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 319 transitions, 934 flow, removed 528 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:31,851 INFO L231 Difference]: Finished difference. Result has 390 places, 318 transitions, 844 flow [2025-01-09 21:41:31,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1296, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=390, PETRI_TRANSITIONS=318} [2025-01-09 21:41:31,851 INFO L279 CegarLoopForPetriNet]: 390 programPoint places, 0 predicate places. [2025-01-09 21:41:31,852 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 318 transitions, 844 flow [2025-01-09 21:41:31,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 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-01-09 21:41:31,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:31,852 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] [2025-01-09 21:41:31,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-01-09 21:41:31,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:31,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2114058569, now seen corresponding path program 1 times [2025-01-09 21:41:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:31,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-01-09 21:41:31,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:31,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:31,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:31,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:31,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-01-09 21:41:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008650586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:31,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867087677] [2025-01-09 21:41:31,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:31,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:31,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:31,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:31,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1296 [2025-01-09 21:41:31,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 318 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 1010.0) internal successors, (3030), 3 states have internal predecessors, (3030), 0 states have call successors, (0), 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-01-09 21:41:31,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:31,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1296 [2025-01-09 21:41:31,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:32,202 INFO L124 PetriNetUnfolderBase]: 36/1565 cut-off events. [2025-01-09 21:41:32,202 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2025-01-09 21:41:32,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 1565 events. 36/1565 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3503 event pairs, 0 based on Foata normal form. 35/1529 useless extension candidates. Maximal degree in co-relation 1898. Up to 180 conditions per place. [2025-01-09 21:41:32,224 INFO L140 encePairwiseOnDemand]: 1290/1296 looper letters, 42 selfloop transitions, 1 changer transitions 24/313 dead transitions. [2025-01-09 21:41:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 313 transitions, 924 flow [2025-01-09 21:41:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3077 transitions. [2025-01-09 21:41:32,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7914094650205762 [2025-01-09 21:41:32,226 INFO L175 Difference]: Start difference. First operand has 390 places, 318 transitions, 844 flow. Second operand 3 states and 3077 transitions. [2025-01-09 21:41:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 313 transitions, 924 flow [2025-01-09 21:41:32,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 313 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:32,229 INFO L231 Difference]: Finished difference. Result has 384 places, 289 transitions, 782 flow [2025-01-09 21:41:32,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1296, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=384, PETRI_TRANSITIONS=289} [2025-01-09 21:41:32,230 INFO L279 CegarLoopForPetriNet]: 390 programPoint places, -6 predicate places. [2025-01-09 21:41:32,230 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 289 transitions, 782 flow [2025-01-09 21:41:32,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.0) internal successors, (3030), 3 states have internal predecessors, (3030), 0 states have call successors, (0), 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-01-09 21:41:32,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:32,230 INFO L206 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:32,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-01-09 21:41:32,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1294149059, now seen corresponding path program 1 times [2025-01-09 21:41:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-01-09 21:41:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:32,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-01-09 21:41:32,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-01-09 21:41:32,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:32,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:32,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-01-09 21:41:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:32,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799354167] [2025-01-09 21:41:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:32,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:32,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:32,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:32,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1111 out of 1296 [2025-01-09 21:41:32,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 289 transitions, 782 flow. Second operand has 5 states, 5 states have (on average 1119.8) internal successors, (5599), 5 states have internal predecessors, (5599), 0 states have call successors, (0), 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-01-09 21:41:32,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:32,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1111 of 1296 [2025-01-09 21:41:32,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:32,602 INFO L124 PetriNetUnfolderBase]: 0/738 cut-off events. [2025-01-09 21:41:32,603 INFO L125 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2025-01-09 21:41:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 738 events. 0/738 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 435 event pairs, 0 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 0. Up to 110 conditions per place. [2025-01-09 21:41:32,604 INFO L140 encePairwiseOnDemand]: 1291/1296 looper letters, 42 selfloop transitions, 2 changer transitions 3/291 dead transitions. [2025-01-09 21:41:32,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 291 transitions, 880 flow [2025-01-09 21:41:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5603 transitions. [2025-01-09 21:41:32,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8646604938271605 [2025-01-09 21:41:32,606 INFO L175 Difference]: Start difference. First operand has 384 places, 289 transitions, 782 flow. Second operand 5 states and 5603 transitions. [2025-01-09 21:41:32,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 291 transitions, 880 flow [2025-01-09 21:41:32,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 291 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:32,608 INFO L231 Difference]: Finished difference. Result has 364 places, 288 transitions, 787 flow [2025-01-09 21:41:32,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1296, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=364, PETRI_TRANSITIONS=288} [2025-01-09 21:41:32,609 INFO L279 CegarLoopForPetriNet]: 390 programPoint places, -26 predicate places. [2025-01-09 21:41:32,609 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 288 transitions, 787 flow [2025-01-09 21:41:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1119.8) internal successors, (5599), 5 states have internal predecessors, (5599), 0 states have call successors, (0), 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-01-09 21:41:32,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:32,609 INFO L206 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:32,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-01-09 21:41:32,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-01-09 21:41:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -315957048, now seen corresponding path program 1 times [2025-01-09 21:41:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-01-09 21:41:32,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:32,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 21:41:32,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 21:41:32,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:32,655 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 21:41:32,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 21:41:32,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:32,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:32,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:32,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 42 remaining) [2025-01-09 21:41:32,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 42 remaining) [2025-01-09 21:41:32,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 42 remaining) [2025-01-09 21:41:32,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-01-09 21:41:32,853 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:32,853 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:32,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2025-01-09 21:41:32,950 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:32,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1366 places, 1332 transitions, 5324 flow [2025-01-09 21:41:33,271 INFO L124 PetriNetUnfolderBase]: 146/2299 cut-off events. [2025-01-09 21:41:33,272 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2025-01-09 21:41:33,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 2299 events. 146/2299 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6699 event pairs, 0 based on Foata normal form. 0/2041 useless extension candidates. Maximal degree in co-relation 3036. Up to 72 conditions per place. [2025-01-09 21:41:33,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 1366 places, 1332 transitions, 5324 flow [2025-01-09 21:41:33,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 399 places, 329 transitions, 1991 flow [2025-01-09 21:41:33,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:33,319 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:33,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-09 21:41:33,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:33,320 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:33,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:33,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:33,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:33,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:33,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:33,320 INFO L85 PathProgramCache]: Analyzing trace with hash 420184259, now seen corresponding path program 1 times [2025-01-09 21:41:33,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:33,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-01-09 21:41:33,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:33,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:33,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:33,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:33,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:33,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-01-09 21:41:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180950138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557025848] [2025-01-09 21:41:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:33,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:33,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1109 out of 1332 [2025-01-09 21:41:33,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 329 transitions, 1991 flow. Second operand has 3 states, 3 states have (on average 1110.3333333333333) internal successors, (3331), 3 states have internal predecessors, (3331), 0 states have call successors, (0), 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-01-09 21:41:33,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:33,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1109 of 1332 [2025-01-09 21:41:33,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:33,755 INFO L124 PetriNetUnfolderBase]: 73/1793 cut-off events. [2025-01-09 21:41:33,755 INFO L125 PetriNetUnfolderBase]: For 8401/8401 co-relation queries the response was YES. [2025-01-09 21:41:33,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1793 events. 73/1793 cut-off events. For 8401/8401 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4885 event pairs, 36 based on Foata normal form. 1/1645 useless extension candidates. Maximal degree in co-relation 2694. Up to 258 conditions per place. [2025-01-09 21:41:33,785 INFO L140 encePairwiseOnDemand]: 1327/1332 looper letters, 45 selfloop transitions, 2 changer transitions 1/326 dead transitions. [2025-01-09 21:41:33,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 326 transitions, 2079 flow [2025-01-09 21:41:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3377 transitions. [2025-01-09 21:41:33,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450950950950951 [2025-01-09 21:41:33,787 INFO L175 Difference]: Start difference. First operand has 399 places, 329 transitions, 1991 flow. Second operand 3 states and 3377 transitions. [2025-01-09 21:41:33,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 326 transitions, 2079 flow [2025-01-09 21:41:33,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 326 transitions, 956 flow, removed 561 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:33,798 INFO L231 Difference]: Finished difference. Result has 399 places, 325 transitions, 864 flow [2025-01-09 21:41:33,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1332, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=399, PETRI_TRANSITIONS=325} [2025-01-09 21:41:33,798 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, 0 predicate places. [2025-01-09 21:41:33,799 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 325 transitions, 864 flow [2025-01-09 21:41:33,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1110.3333333333333) internal successors, (3331), 3 states have internal predecessors, (3331), 0 states have call successors, (0), 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-01-09 21:41:33,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:33,799 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] [2025-01-09 21:41:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-01-09 21:41:33,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash -527869367, now seen corresponding path program 1 times [2025-01-09 21:41:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-01-09 21:41:33,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:33,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:33,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:33,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:33,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324520816] [2025-01-09 21:41:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324520816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-01-09 21:41:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:33,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:33,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:33,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:33,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1037 out of 1332 [2025-01-09 21:41:33,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 325 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 0 states have call successors, (0), 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-01-09 21:41:33,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:33,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1037 of 1332 [2025-01-09 21:41:33,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:34,156 INFO L124 PetriNetUnfolderBase]: 37/1609 cut-off events. [2025-01-09 21:41:34,157 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2025-01-09 21:41:34,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 1609 events. 37/1609 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3605 event pairs, 0 based on Foata normal form. 36/1572 useless extension candidates. Maximal degree in co-relation 1952. Up to 185 conditions per place. [2025-01-09 21:41:34,179 INFO L140 encePairwiseOnDemand]: 1326/1332 looper letters, 43 selfloop transitions, 1 changer transitions 24/320 dead transitions. [2025-01-09 21:41:34,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 320 transitions, 946 flow [2025-01-09 21:41:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3162 transitions. [2025-01-09 21:41:34,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7912912912912913 [2025-01-09 21:41:34,181 INFO L175 Difference]: Start difference. First operand has 399 places, 325 transitions, 864 flow. Second operand 3 states and 3162 transitions. [2025-01-09 21:41:34,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 320 transitions, 946 flow [2025-01-09 21:41:34,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 320 transitions, 942 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:34,183 INFO L231 Difference]: Finished difference. Result has 393 places, 296 transitions, 802 flow [2025-01-09 21:41:34,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1332, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=393, PETRI_TRANSITIONS=296} [2025-01-09 21:41:34,184 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -6 predicate places. [2025-01-09 21:41:34,184 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 296 transitions, 802 flow [2025-01-09 21:41:34,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 0 states have call successors, (0), 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-01-09 21:41:34,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:34,184 INFO L206 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-01-09 21:41:34,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash 96122932, now seen corresponding path program 1 times [2025-01-09 21:41:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:34,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-01-09 21:41:34,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:34,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 21:41:34,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 21:41:34,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:34,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-01-09 21:41:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308431626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713083596] [2025-01-09 21:41:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:34,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:34,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:34,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1142 out of 1332 [2025-01-09 21:41:34,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 296 transitions, 802 flow. Second operand has 5 states, 5 states have (on average 1151.0) internal successors, (5755), 5 states have internal predecessors, (5755), 0 states have call successors, (0), 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-01-09 21:41:34,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:34,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1142 of 1332 [2025-01-09 21:41:34,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:34,588 INFO L124 PetriNetUnfolderBase]: 0/758 cut-off events. [2025-01-09 21:41:34,588 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2025-01-09 21:41:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 758 events. 0/758 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 447 event pairs, 0 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 0. Up to 113 conditions per place. [2025-01-09 21:41:34,589 INFO L140 encePairwiseOnDemand]: 1327/1332 looper letters, 43 selfloop transitions, 2 changer transitions 3/298 dead transitions. [2025-01-09 21:41:34,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 298 transitions, 902 flow [2025-01-09 21:41:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5759 transitions. [2025-01-09 21:41:34,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8647147147147147 [2025-01-09 21:41:34,591 INFO L175 Difference]: Start difference. First operand has 393 places, 296 transitions, 802 flow. Second operand 5 states and 5759 transitions. [2025-01-09 21:41:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 298 transitions, 902 flow [2025-01-09 21:41:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 298 transitions, 901 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:34,594 INFO L231 Difference]: Finished difference. Result has 373 places, 295 transitions, 807 flow [2025-01-09 21:41:34,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1332, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=807, PETRI_PLACES=373, PETRI_TRANSITIONS=295} [2025-01-09 21:41:34,598 INFO L279 CegarLoopForPetriNet]: 399 programPoint places, -26 predicate places. [2025-01-09 21:41:34,598 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 295 transitions, 807 flow [2025-01-09 21:41:34,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1151.0) internal successors, (5755), 5 states have internal predecessors, (5755), 0 states have call successors, (0), 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-01-09 21:41:34,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:34,598 INFO L206 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:34,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-01-09 21:41:34,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:41:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1434565707, now seen corresponding path program 1 times [2025-01-09 21:41:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:34,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-01-09 21:41:34,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:34,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:34,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 21:41:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 21:41:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:34,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:34,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 21:41:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 21:41:34,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:34,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:34,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:34,845 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:34,845 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 43 remaining) [2025-01-09 21:41:34,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2025-01-09 21:41:34,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2025-01-09 21:41:34,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2025-01-09 21:41:34,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2025-01-09 21:41:34,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 43 remaining) [2025-01-09 21:41:34,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-01-09 21:41:34,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:34,854 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:34,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2025-01-09 21:41:34,983 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:34,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1403 places, 1368 transitions, 5544 flow [2025-01-09 21:41:35,335 INFO L124 PetriNetUnfolderBase]: 150/2362 cut-off events. [2025-01-09 21:41:35,335 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2025-01-09 21:41:35,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3211 conditions, 2362 events. 150/2362 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6663 event pairs, 0 based on Foata normal form. 0/2097 useless extension candidates. Maximal degree in co-relation 3138. Up to 74 conditions per place. [2025-01-09 21:41:35,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 1403 places, 1368 transitions, 5544 flow [2025-01-09 21:41:35,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 408 places, 336 transitions, 2079 flow [2025-01-09 21:41:35,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:35,381 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:35,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 21:41:35,382 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:35,382 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:35,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:35,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:35,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:35,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -575416125, now seen corresponding path program 1 times [2025-01-09 21:41:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-01-09 21:41:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:35,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:35,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:35,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-01-09 21:41:35,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101989819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:35,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:35,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-01-09 21:41:35,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:35,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:35,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:35,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:35,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:35,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1139 out of 1368 [2025-01-09 21:41:35,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 336 transitions, 2079 flow. Second operand has 3 states, 3 states have (on average 1140.3333333333333) internal successors, (3421), 3 states have internal predecessors, (3421), 0 states have call successors, (0), 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-01-09 21:41:35,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:35,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1139 of 1368 [2025-01-09 21:41:35,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:35,841 INFO L124 PetriNetUnfolderBase]: 75/1842 cut-off events. [2025-01-09 21:41:35,841 INFO L125 PetriNetUnfolderBase]: For 9103/9103 co-relation queries the response was YES. [2025-01-09 21:41:35,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 1842 events. 75/1842 cut-off events. For 9103/9103 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5057 event pairs, 37 based on Foata normal form. 1/1690 useless extension candidates. Maximal degree in co-relation 2788. Up to 265 conditions per place. [2025-01-09 21:41:35,873 INFO L140 encePairwiseOnDemand]: 1363/1368 looper letters, 46 selfloop transitions, 2 changer transitions 1/333 dead transitions. [2025-01-09 21:41:35,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 333 transitions, 2169 flow [2025-01-09 21:41:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3468 transitions. [2025-01-09 21:41:35,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450292397660819 [2025-01-09 21:41:35,875 INFO L175 Difference]: Start difference. First operand has 408 places, 336 transitions, 2079 flow. Second operand 3 states and 3468 transitions. [2025-01-09 21:41:35,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 333 transitions, 2169 flow [2025-01-09 21:41:35,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 333 transitions, 978 flow, removed 595 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:35,886 INFO L231 Difference]: Finished difference. Result has 408 places, 332 transitions, 884 flow [2025-01-09 21:41:35,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1368, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=408, PETRI_TRANSITIONS=332} [2025-01-09 21:41:35,886 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, 0 predicate places. [2025-01-09 21:41:35,886 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 332 transitions, 884 flow [2025-01-09 21:41:35,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1140.3333333333333) internal successors, (3421), 3 states have internal predecessors, (3421), 0 states have call successors, (0), 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-01-09 21:41:35,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:35,887 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] [2025-01-09 21:41:35,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-01-09 21:41:35,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:35,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -339195831, now seen corresponding path program 1 times [2025-01-09 21:41:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-01-09 21:41:35,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:35,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:35,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-01-09 21:41:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606070089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:35,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323020215] [2025-01-09 21:41:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:35,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:35,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:35,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1368 [2025-01-09 21:41:35,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 332 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 1066.0) internal successors, (3198), 3 states have internal predecessors, (3198), 0 states have call successors, (0), 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-01-09 21:41:35,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:35,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1368 [2025-01-09 21:41:35,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:36,275 INFO L124 PetriNetUnfolderBase]: 38/1653 cut-off events. [2025-01-09 21:41:36,275 INFO L125 PetriNetUnfolderBase]: For 737/737 co-relation queries the response was YES. [2025-01-09 21:41:36,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 1653 events. 38/1653 cut-off events. For 737/737 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3708 event pairs, 0 based on Foata normal form. 37/1615 useless extension candidates. Maximal degree in co-relation 2006. Up to 190 conditions per place. [2025-01-09 21:41:36,300 INFO L140 encePairwiseOnDemand]: 1362/1368 looper letters, 44 selfloop transitions, 1 changer transitions 24/327 dead transitions. [2025-01-09 21:41:36,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 327 transitions, 968 flow [2025-01-09 21:41:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3247 transitions. [2025-01-09 21:41:36,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7911793372319688 [2025-01-09 21:41:36,301 INFO L175 Difference]: Start difference. First operand has 408 places, 332 transitions, 884 flow. Second operand 3 states and 3247 transitions. [2025-01-09 21:41:36,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 327 transitions, 968 flow [2025-01-09 21:41:36,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 327 transitions, 964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:36,304 INFO L231 Difference]: Finished difference. Result has 402 places, 303 transitions, 822 flow [2025-01-09 21:41:36,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1368, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=402, PETRI_TRANSITIONS=303} [2025-01-09 21:41:36,305 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -6 predicate places. [2025-01-09 21:41:36,305 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 303 transitions, 822 flow [2025-01-09 21:41:36,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.0) internal successors, (3198), 3 states have internal predecessors, (3198), 0 states have call successors, (0), 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-01-09 21:41:36,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:36,305 INFO L206 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:36,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-01-09 21:41:36,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -809427050, now seen corresponding path program 1 times [2025-01-09 21:41:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523627420] [2025-01-09 21:41:36,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 21:41:36,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 21:41:36,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:36,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523627420] [2025-01-09 21:41:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523627420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:36,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:36,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147408768] [2025-01-09 21:41:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:36,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:36,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1173 out of 1368 [2025-01-09 21:41:36,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 303 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 1182.2) internal successors, (5911), 5 states have internal predecessors, (5911), 0 states have call successors, (0), 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-01-09 21:41:36,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:36,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1173 of 1368 [2025-01-09 21:41:36,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:36,797 INFO L124 PetriNetUnfolderBase]: 0/778 cut-off events. [2025-01-09 21:41:36,798 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2025-01-09 21:41:36,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 778 events. 0/778 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 460 event pairs, 0 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 0. Up to 116 conditions per place. [2025-01-09 21:41:36,798 INFO L140 encePairwiseOnDemand]: 1363/1368 looper letters, 44 selfloop transitions, 2 changer transitions 3/305 dead transitions. [2025-01-09 21:41:36,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 305 transitions, 924 flow [2025-01-09 21:41:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5915 transitions. [2025-01-09 21:41:36,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8647660818713451 [2025-01-09 21:41:36,800 INFO L175 Difference]: Start difference. First operand has 402 places, 303 transitions, 822 flow. Second operand 5 states and 5915 transitions. [2025-01-09 21:41:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 305 transitions, 924 flow [2025-01-09 21:41:36,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 305 transitions, 923 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:36,803 INFO L231 Difference]: Finished difference. Result has 382 places, 302 transitions, 827 flow [2025-01-09 21:41:36,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1368, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=827, PETRI_PLACES=382, PETRI_TRANSITIONS=302} [2025-01-09 21:41:36,803 INFO L279 CegarLoopForPetriNet]: 408 programPoint places, -26 predicate places. [2025-01-09 21:41:36,803 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 302 transitions, 827 flow [2025-01-09 21:41:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1182.2) internal successors, (5911), 5 states have internal predecessors, (5911), 0 states have call successors, (0), 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-01-09 21:41:36,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:36,804 INFO L206 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:36,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-01-09 21:41:36,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:41:36,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash -357326827, now seen corresponding path program 1 times [2025-01-09 21:41:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012755967] [2025-01-09 21:41:36,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 21:41:36,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 21:41:36,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:36,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:36,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:36,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-09 21:41:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-09 21:41:36,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:36,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:36,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:36,986 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:36,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-01-09 21:41:36,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-01-09 21:41:36,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-01-09 21:41:36,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-01-09 21:41:36,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-01-09 21:41:36,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:36,989 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:36,989 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2025-01-09 21:41:37,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:37,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1440 places, 1404 transitions, 5768 flow [2025-01-09 21:41:37,443 INFO L124 PetriNetUnfolderBase]: 154/2425 cut-off events. [2025-01-09 21:41:37,443 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2025-01-09 21:41:37,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 2425 events. 154/2425 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6928 event pairs, 0 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 3241. Up to 76 conditions per place. [2025-01-09 21:41:37,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 1440 places, 1404 transitions, 5768 flow [2025-01-09 21:41:37,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 417 places, 343 transitions, 2169 flow [2025-01-09 21:41:37,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:37,494 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:37,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-01-09 21:41:37,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:37,495 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:37,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:37,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:37,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:37,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -806038333, now seen corresponding path program 1 times [2025-01-09 21:41:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-09 21:41:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:37,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:37,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635838974] [2025-01-09 21:41:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635838974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484989305] [2025-01-09 21:41:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:37,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:37,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:37,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1169 out of 1404 [2025-01-09 21:41:37,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 343 transitions, 2169 flow. Second operand has 3 states, 3 states have (on average 1170.3333333333333) internal successors, (3511), 3 states have internal predecessors, (3511), 0 states have call successors, (0), 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-01-09 21:41:37,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:37,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1169 of 1404 [2025-01-09 21:41:37,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:38,001 INFO L124 PetriNetUnfolderBase]: 77/1891 cut-off events. [2025-01-09 21:41:38,002 INFO L125 PetriNetUnfolderBase]: For 9843/9843 co-relation queries the response was YES. [2025-01-09 21:41:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 1891 events. 77/1891 cut-off events. For 9843/9843 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5206 event pairs, 38 based on Foata normal form. 1/1735 useless extension candidates. Maximal degree in co-relation 2883. Up to 272 conditions per place. [2025-01-09 21:41:38,038 INFO L140 encePairwiseOnDemand]: 1399/1404 looper letters, 47 selfloop transitions, 2 changer transitions 1/340 dead transitions. [2025-01-09 21:41:38,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 340 transitions, 2261 flow [2025-01-09 21:41:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:38,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3559 transitions. [2025-01-09 21:41:38,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449667616334283 [2025-01-09 21:41:38,040 INFO L175 Difference]: Start difference. First operand has 417 places, 343 transitions, 2169 flow. Second operand 3 states and 3559 transitions. [2025-01-09 21:41:38,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 340 transitions, 2261 flow [2025-01-09 21:41:38,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 340 transitions, 1000 flow, removed 630 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:38,052 INFO L231 Difference]: Finished difference. Result has 417 places, 339 transitions, 904 flow [2025-01-09 21:41:38,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1404, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=417, PETRI_TRANSITIONS=339} [2025-01-09 21:41:38,052 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, 0 predicate places. [2025-01-09 21:41:38,052 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 339 transitions, 904 flow [2025-01-09 21:41:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1170.3333333333333) internal successors, (3511), 3 states have internal predecessors, (3511), 0 states have call successors, (0), 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-01-09 21:41:38,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:38,052 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] [2025-01-09 21:41:38,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-01-09 21:41:38,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:38,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1614888119, now seen corresponding path program 1 times [2025-01-09 21:41:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-01-09 21:41:38,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:38,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:38,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:38,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118981953] [2025-01-09 21:41:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118981953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275082785] [2025-01-09 21:41:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:38,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:38,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:38,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:38,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1093 out of 1404 [2025-01-09 21:41:38,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 339 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 1094.0) internal successors, (3282), 3 states have internal predecessors, (3282), 0 states have call successors, (0), 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-01-09 21:41:38,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:38,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1093 of 1404 [2025-01-09 21:41:38,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:38,446 INFO L124 PetriNetUnfolderBase]: 39/1697 cut-off events. [2025-01-09 21:41:38,446 INFO L125 PetriNetUnfolderBase]: For 776/776 co-relation queries the response was YES. [2025-01-09 21:41:38,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1697 events. 39/1697 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3809 event pairs, 0 based on Foata normal form. 38/1658 useless extension candidates. Maximal degree in co-relation 2060. Up to 195 conditions per place. [2025-01-09 21:41:38,471 INFO L140 encePairwiseOnDemand]: 1398/1404 looper letters, 45 selfloop transitions, 1 changer transitions 24/334 dead transitions. [2025-01-09 21:41:38,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 334 transitions, 990 flow [2025-01-09 21:41:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3332 transitions. [2025-01-09 21:41:38,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7910731244064577 [2025-01-09 21:41:38,473 INFO L175 Difference]: Start difference. First operand has 417 places, 339 transitions, 904 flow. Second operand 3 states and 3332 transitions. [2025-01-09 21:41:38,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 334 transitions, 990 flow [2025-01-09 21:41:38,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 334 transitions, 986 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:38,476 INFO L231 Difference]: Finished difference. Result has 411 places, 310 transitions, 842 flow [2025-01-09 21:41:38,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1404, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=411, PETRI_TRANSITIONS=310} [2025-01-09 21:41:38,476 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -6 predicate places. [2025-01-09 21:41:38,476 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 310 transitions, 842 flow [2025-01-09 21:41:38,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1094.0) internal successors, (3282), 3 states have internal predecessors, (3282), 0 states have call successors, (0), 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-01-09 21:41:38,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:38,477 INFO L206 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:38,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-01-09 21:41:38,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -289996701, now seen corresponding path program 1 times [2025-01-09 21:41:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-01-09 21:41:38,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:38,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 21:41:38,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 21:41:38,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862842470] [2025-01-09 21:41:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862842470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949458797] [2025-01-09 21:41:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:38,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:38,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:38,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1204 out of 1404 [2025-01-09 21:41:38,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 310 transitions, 842 flow. Second operand has 5 states, 5 states have (on average 1213.4) internal successors, (6067), 5 states have internal predecessors, (6067), 0 states have call successors, (0), 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-01-09 21:41:38,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:38,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1204 of 1404 [2025-01-09 21:41:38,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:39,037 INFO L124 PetriNetUnfolderBase]: 0/798 cut-off events. [2025-01-09 21:41:39,037 INFO L125 PetriNetUnfolderBase]: For 775/775 co-relation queries the response was YES. [2025-01-09 21:41:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 798 events. 0/798 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 471 event pairs, 0 based on Foata normal form. 1/798 useless extension candidates. Maximal degree in co-relation 0. Up to 119 conditions per place. [2025-01-09 21:41:39,038 INFO L140 encePairwiseOnDemand]: 1399/1404 looper letters, 45 selfloop transitions, 2 changer transitions 3/312 dead transitions. [2025-01-09 21:41:39,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 312 transitions, 946 flow [2025-01-09 21:41:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6071 transitions. [2025-01-09 21:41:39,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8648148148148148 [2025-01-09 21:41:39,042 INFO L175 Difference]: Start difference. First operand has 411 places, 310 transitions, 842 flow. Second operand 5 states and 6071 transitions. [2025-01-09 21:41:39,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 312 transitions, 946 flow [2025-01-09 21:41:39,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 312 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:39,045 INFO L231 Difference]: Finished difference. Result has 391 places, 309 transitions, 847 flow [2025-01-09 21:41:39,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1404, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=847, PETRI_PLACES=391, PETRI_TRANSITIONS=309} [2025-01-09 21:41:39,046 INFO L279 CegarLoopForPetriNet]: 417 programPoint places, -26 predicate places. [2025-01-09 21:41:39,046 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 309 transitions, 847 flow [2025-01-09 21:41:39,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1213.4) internal successors, (6067), 5 states have internal predecessors, (6067), 0 states have call successors, (0), 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-01-09 21:41:39,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:39,046 INFO L206 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:39,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-01-09 21:41:39,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-01-09 21:41:39,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 953526566, now seen corresponding path program 1 times [2025-01-09 21:41:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-01-09 21:41:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:39,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-09 21:41:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-09 21:41:39,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:39,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:39,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-09 21:41:39,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-09 21:41:39,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:39,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:39,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:39,356 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:39,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-01-09 21:41:39,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-01-09 21:41:39,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-01-09 21:41:39,359 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-01-09 21:41:39,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-01-09 21:41:39,359 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:39,359 WARN L246 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:39,360 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2025-01-09 21:41:39,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:39,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1477 places, 1440 transitions, 5996 flow [2025-01-09 21:41:39,905 INFO L124 PetriNetUnfolderBase]: 158/2488 cut-off events. [2025-01-09 21:41:39,905 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2025-01-09 21:41:39,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 2488 events. 158/2488 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7265 event pairs, 0 based on Foata normal form. 0/2209 useless extension candidates. Maximal degree in co-relation 3345. Up to 78 conditions per place. [2025-01-09 21:41:39,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 1477 places, 1440 transitions, 5996 flow [2025-01-09 21:41:39,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 426 places, 350 transitions, 2261 flow [2025-01-09 21:41:39,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:39,959 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:39,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 21:41:39,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:39,960 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:39,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:39,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:39,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:39,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:39,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -271682365, now seen corresponding path program 1 times [2025-01-09 21:41:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889382153] [2025-01-09 21:41:39,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:39,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:39,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:39,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:39,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:39,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889382153] [2025-01-09 21:41:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889382153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:39,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675293951] [2025-01-09 21:41:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:39,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:39,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:39,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:40,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1199 out of 1440 [2025-01-09 21:41:40,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 350 transitions, 2261 flow. Second operand has 3 states, 3 states have (on average 1200.3333333333333) internal successors, (3601), 3 states have internal predecessors, (3601), 0 states have call successors, (0), 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-01-09 21:41:40,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:40,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1199 of 1440 [2025-01-09 21:41:40,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:40,442 INFO L124 PetriNetUnfolderBase]: 79/1940 cut-off events. [2025-01-09 21:41:40,442 INFO L125 PetriNetUnfolderBase]: For 10622/10622 co-relation queries the response was YES. [2025-01-09 21:41:40,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1940 events. 79/1940 cut-off events. For 10622/10622 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5105 event pairs, 39 based on Foata normal form. 1/1780 useless extension candidates. Maximal degree in co-relation 2979. Up to 279 conditions per place. [2025-01-09 21:41:40,483 INFO L140 encePairwiseOnDemand]: 1435/1440 looper letters, 48 selfloop transitions, 2 changer transitions 1/347 dead transitions. [2025-01-09 21:41:40,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 347 transitions, 2355 flow [2025-01-09 21:41:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3650 transitions. [2025-01-09 21:41:40,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2025-01-09 21:41:40,485 INFO L175 Difference]: Start difference. First operand has 426 places, 350 transitions, 2261 flow. Second operand 3 states and 3650 transitions. [2025-01-09 21:41:40,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 347 transitions, 2355 flow [2025-01-09 21:41:40,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 347 transitions, 1022 flow, removed 666 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:40,498 INFO L231 Difference]: Finished difference. Result has 426 places, 346 transitions, 924 flow [2025-01-09 21:41:40,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1440, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=426, PETRI_TRANSITIONS=346} [2025-01-09 21:41:40,498 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, 0 predicate places. [2025-01-09 21:41:40,498 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 346 transitions, 924 flow [2025-01-09 21:41:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1200.3333333333333) internal successors, (3601), 3 states have internal predecessors, (3601), 0 states have call successors, (0), 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-01-09 21:41:40,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:40,498 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] [2025-01-09 21:41:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-01-09 21:41:40,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -59978935, now seen corresponding path program 1 times [2025-01-09 21:41:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-01-09 21:41:40,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:40,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:40,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:40,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-01-09 21:41:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703300574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:40,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782505605] [2025-01-09 21:41:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:40,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:40,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:40,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1121 out of 1440 [2025-01-09 21:41:40,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 346 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 1122.0) internal successors, (3366), 3 states have internal predecessors, (3366), 0 states have call successors, (0), 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-01-09 21:41:40,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:40,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1121 of 1440 [2025-01-09 21:41:40,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:40,925 INFO L124 PetriNetUnfolderBase]: 40/1741 cut-off events. [2025-01-09 21:41:40,925 INFO L125 PetriNetUnfolderBase]: For 816/816 co-relation queries the response was YES. [2025-01-09 21:41:40,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 1741 events. 40/1741 cut-off events. For 816/816 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 3834 event pairs, 0 based on Foata normal form. 39/1701 useless extension candidates. Maximal degree in co-relation 2114. Up to 200 conditions per place. [2025-01-09 21:41:40,952 INFO L140 encePairwiseOnDemand]: 1434/1440 looper letters, 46 selfloop transitions, 1 changer transitions 24/341 dead transitions. [2025-01-09 21:41:40,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 341 transitions, 1012 flow [2025-01-09 21:41:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3417 transitions. [2025-01-09 21:41:40,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7909722222222222 [2025-01-09 21:41:40,954 INFO L175 Difference]: Start difference. First operand has 426 places, 346 transitions, 924 flow. Second operand 3 states and 3417 transitions. [2025-01-09 21:41:40,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 341 transitions, 1012 flow [2025-01-09 21:41:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 341 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:40,957 INFO L231 Difference]: Finished difference. Result has 420 places, 317 transitions, 862 flow [2025-01-09 21:41:40,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1440, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=420, PETRI_TRANSITIONS=317} [2025-01-09 21:41:40,958 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, -6 predicate places. [2025-01-09 21:41:40,958 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 317 transitions, 862 flow [2025-01-09 21:41:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1122.0) internal successors, (3366), 3 states have internal predecessors, (3366), 0 states have call successors, (0), 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-01-09 21:41:40,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:40,958 INFO L206 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-01-09 21:41:40,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:40,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1491608933, now seen corresponding path program 1 times [2025-01-09 21:41:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-01-09 21:41:40,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 21:41:40,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 21:41:40,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:40,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:41,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-01-09 21:41:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66165180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675782744] [2025-01-09 21:41:41,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:41,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:41,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:41,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1235 out of 1440 [2025-01-09 21:41:41,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 317 transitions, 862 flow. Second operand has 5 states, 5 states have (on average 1244.6) internal successors, (6223), 5 states have internal predecessors, (6223), 0 states have call successors, (0), 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-01-09 21:41:41,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:41,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1235 of 1440 [2025-01-09 21:41:41,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:41,450 INFO L124 PetriNetUnfolderBase]: 0/818 cut-off events. [2025-01-09 21:41:41,450 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2025-01-09 21:41:41,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 818 events. 0/818 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 484 event pairs, 0 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 0. Up to 122 conditions per place. [2025-01-09 21:41:41,451 INFO L140 encePairwiseOnDemand]: 1435/1440 looper letters, 46 selfloop transitions, 2 changer transitions 3/319 dead transitions. [2025-01-09 21:41:41,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 319 transitions, 968 flow [2025-01-09 21:41:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6227 transitions. [2025-01-09 21:41:41,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8648611111111111 [2025-01-09 21:41:41,453 INFO L175 Difference]: Start difference. First operand has 420 places, 317 transitions, 862 flow. Second operand 5 states and 6227 transitions. [2025-01-09 21:41:41,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 319 transitions, 968 flow [2025-01-09 21:41:41,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 319 transitions, 967 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:41,456 INFO L231 Difference]: Finished difference. Result has 400 places, 316 transitions, 867 flow [2025-01-09 21:41:41,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1440, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=867, PETRI_PLACES=400, PETRI_TRANSITIONS=316} [2025-01-09 21:41:41,457 INFO L279 CegarLoopForPetriNet]: 426 programPoint places, -26 predicate places. [2025-01-09 21:41:41,457 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 316 transitions, 867 flow [2025-01-09 21:41:41,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1244.6) internal successors, (6223), 5 states have internal predecessors, (6223), 0 states have call successors, (0), 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-01-09 21:41:41,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:41,457 INFO L206 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:41,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-01-09 21:41:41,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-01-09 21:41:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1319896190, now seen corresponding path program 1 times [2025-01-09 21:41:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243487637] [2025-01-09 21:41:41,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:41,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 21:41:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 21:41:41,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:41,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:41,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:41,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 21:41:41,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 21:41:41,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:41,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:41,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:41,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-01-09 21:41:41,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-01-09 21:41:41,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-01-09 21:41:41,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-01-09 21:41:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-01-09 21:41:41,665 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:41,665 WARN L246 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:41,665 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2025-01-09 21:41:41,768 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1514 places, 1476 transitions, 6228 flow [2025-01-09 21:41:42,163 INFO L124 PetriNetUnfolderBase]: 162/2551 cut-off events. [2025-01-09 21:41:42,163 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2025-01-09 21:41:42,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 2551 events. 162/2551 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7528 event pairs, 0 based on Foata normal form. 0/2265 useless extension candidates. Maximal degree in co-relation 3450. Up to 80 conditions per place. [2025-01-09 21:41:42,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 1514 places, 1476 transitions, 6228 flow [2025-01-09 21:41:42,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 357 transitions, 2355 flow [2025-01-09 21:41:42,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:42,222 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:42,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-01-09 21:41:42,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:42,222 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:42,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:42,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:42,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:42,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:42,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1027651779, now seen corresponding path program 1 times [2025-01-09 21:41:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-01-09 21:41:42,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:42,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:42,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:42,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:42,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699042494] [2025-01-09 21:41:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699042494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392123391] [2025-01-09 21:41:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:42,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:42,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:42,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:42,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1229 out of 1476 [2025-01-09 21:41:42,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 357 transitions, 2355 flow. Second operand has 3 states, 3 states have (on average 1230.3333333333333) internal successors, (3691), 3 states have internal predecessors, (3691), 0 states have call successors, (0), 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-01-09 21:41:42,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:42,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1229 of 1476 [2025-01-09 21:41:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:42,749 INFO L124 PetriNetUnfolderBase]: 81/1989 cut-off events. [2025-01-09 21:41:42,750 INFO L125 PetriNetUnfolderBase]: For 11441/11441 co-relation queries the response was YES. [2025-01-09 21:41:42,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 1989 events. 81/1989 cut-off events. For 11441/11441 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5433 event pairs, 40 based on Foata normal form. 1/1825 useless extension candidates. Maximal degree in co-relation 3076. Up to 286 conditions per place. [2025-01-09 21:41:42,790 INFO L140 encePairwiseOnDemand]: 1471/1476 looper letters, 49 selfloop transitions, 2 changer transitions 1/354 dead transitions. [2025-01-09 21:41:42,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 354 transitions, 2451 flow [2025-01-09 21:41:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3741 transitions. [2025-01-09 21:41:42,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8448509485094851 [2025-01-09 21:41:42,792 INFO L175 Difference]: Start difference. First operand has 435 places, 357 transitions, 2355 flow. Second operand 3 states and 3741 transitions. [2025-01-09 21:41:42,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 354 transitions, 2451 flow [2025-01-09 21:41:42,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 354 transitions, 1044 flow, removed 703 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:42,806 INFO L231 Difference]: Finished difference. Result has 435 places, 353 transitions, 944 flow [2025-01-09 21:41:42,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1476, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=435, PETRI_TRANSITIONS=353} [2025-01-09 21:41:42,807 INFO L279 CegarLoopForPetriNet]: 435 programPoint places, 0 predicate places. [2025-01-09 21:41:42,807 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 353 transitions, 944 flow [2025-01-09 21:41:42,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1230.3333333333333) internal successors, (3691), 3 states have internal predecessors, (3691), 0 states have call successors, (0), 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-01-09 21:41:42,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:42,807 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] [2025-01-09 21:41:42,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-01-09 21:41:42,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:42,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash 30564425, now seen corresponding path program 1 times [2025-01-09 21:41:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120806117] [2025-01-09 21:41:42,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:42,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:42,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:42,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120806117] [2025-01-09 21:41:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120806117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615518638] [2025-01-09 21:41:42,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:42,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:42,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:42,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:42,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:42,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1149 out of 1476 [2025-01-09 21:41:42,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 353 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 1150.0) internal successors, (3450), 3 states have internal predecessors, (3450), 0 states have call successors, (0), 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-01-09 21:41:42,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:42,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1149 of 1476 [2025-01-09 21:41:42,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:43,253 INFO L124 PetriNetUnfolderBase]: 41/1785 cut-off events. [2025-01-09 21:41:43,254 INFO L125 PetriNetUnfolderBase]: For 857/857 co-relation queries the response was YES. [2025-01-09 21:41:43,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2231 conditions, 1785 events. 41/1785 cut-off events. For 857/857 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4014 event pairs, 0 based on Foata normal form. 40/1744 useless extension candidates. Maximal degree in co-relation 2168. Up to 205 conditions per place. [2025-01-09 21:41:43,290 INFO L140 encePairwiseOnDemand]: 1470/1476 looper letters, 47 selfloop transitions, 1 changer transitions 24/348 dead transitions. [2025-01-09 21:41:43,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 348 transitions, 1034 flow [2025-01-09 21:41:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3502 transitions. [2025-01-09 21:41:43,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7908762420957542 [2025-01-09 21:41:43,292 INFO L175 Difference]: Start difference. First operand has 435 places, 353 transitions, 944 flow. Second operand 3 states and 3502 transitions. [2025-01-09 21:41:43,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 348 transitions, 1034 flow [2025-01-09 21:41:43,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 348 transitions, 1030 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:43,295 INFO L231 Difference]: Finished difference. Result has 429 places, 324 transitions, 882 flow [2025-01-09 21:41:43,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1476, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=429, PETRI_TRANSITIONS=324} [2025-01-09 21:41:43,296 INFO L279 CegarLoopForPetriNet]: 435 programPoint places, -6 predicate places. [2025-01-09 21:41:43,296 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 324 transitions, 882 flow [2025-01-09 21:41:43,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1150.0) internal successors, (3450), 3 states have internal predecessors, (3450), 0 states have call successors, (0), 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-01-09 21:41:43,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:43,296 INFO L206 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-01-09 21:41:43,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -98320834, now seen corresponding path program 1 times [2025-01-09 21:41:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130447316] [2025-01-09 21:41:43,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 21:41:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 21:41:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130447316] [2025-01-09 21:41:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130447316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319012543] [2025-01-09 21:41:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:43,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:43,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:43,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1266 out of 1476 [2025-01-09 21:41:43,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 324 transitions, 882 flow. Second operand has 5 states, 5 states have (on average 1275.8) internal successors, (6379), 5 states have internal predecessors, (6379), 0 states have call successors, (0), 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-01-09 21:41:43,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:43,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1266 of 1476 [2025-01-09 21:41:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:43,810 INFO L124 PetriNetUnfolderBase]: 0/838 cut-off events. [2025-01-09 21:41:43,810 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2025-01-09 21:41:43,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 838 events. 0/838 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 496 event pairs, 0 based on Foata normal form. 1/838 useless extension candidates. Maximal degree in co-relation 0. Up to 125 conditions per place. [2025-01-09 21:41:43,811 INFO L140 encePairwiseOnDemand]: 1471/1476 looper letters, 47 selfloop transitions, 2 changer transitions 3/326 dead transitions. [2025-01-09 21:41:43,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 326 transitions, 990 flow [2025-01-09 21:41:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6383 transitions. [2025-01-09 21:41:43,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8649051490514905 [2025-01-09 21:41:43,815 INFO L175 Difference]: Start difference. First operand has 429 places, 324 transitions, 882 flow. Second operand 5 states and 6383 transitions. [2025-01-09 21:41:43,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 326 transitions, 990 flow [2025-01-09 21:41:43,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 326 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:43,818 INFO L231 Difference]: Finished difference. Result has 409 places, 323 transitions, 887 flow [2025-01-09 21:41:43,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1476, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=887, PETRI_PLACES=409, PETRI_TRANSITIONS=323} [2025-01-09 21:41:43,818 INFO L279 CegarLoopForPetriNet]: 435 programPoint places, -26 predicate places. [2025-01-09 21:41:43,819 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 323 transitions, 887 flow [2025-01-09 21:41:43,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1275.8) internal successors, (6379), 5 states have internal predecessors, (6379), 0 states have call successors, (0), 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-01-09 21:41:43,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:43,819 INFO L206 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:43,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-01-09 21:41:43,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-01-09 21:41:43,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -954601699, now seen corresponding path program 1 times [2025-01-09 21:41:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-01-09 21:41:43,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:43,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 21:41:43,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 21:41:43,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:43,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:43,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:43,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 21:41:43,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 21:41:43,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:44,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:44,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:44,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2025-01-09 21:41:44,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 47 remaining) [2025-01-09 21:41:44,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (44 of 47 remaining) [2025-01-09 21:41:44,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (41 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 47 remaining) [2025-01-09 21:41:44,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 47 remaining) [2025-01-09 21:41:44,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 47 remaining) [2025-01-09 21:41:44,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 47 remaining) [2025-01-09 21:41:44,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 47 remaining) [2025-01-09 21:41:44,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 47 remaining) [2025-01-09 21:41:44,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 47 remaining) [2025-01-09 21:41:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-01-09 21:41:44,040 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:44,040 WARN L246 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:44,040 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2025-01-09 21:41:44,239 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:44,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1551 places, 1512 transitions, 6464 flow [2025-01-09 21:41:44,868 INFO L124 PetriNetUnfolderBase]: 166/2614 cut-off events. [2025-01-09 21:41:44,868 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2025-01-09 21:41:44,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 2614 events. 166/2614 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7504 event pairs, 0 based on Foata normal form. 0/2321 useless extension candidates. Maximal degree in co-relation 3556. Up to 82 conditions per place. [2025-01-09 21:41:44,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 1551 places, 1512 transitions, 6464 flow [2025-01-09 21:41:44,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 364 transitions, 2451 flow [2025-01-09 21:41:44,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:44,908 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:44,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-01-09 21:41:44,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:44,909 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:44,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:44,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:44,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:44,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1203003197, now seen corresponding path program 1 times [2025-01-09 21:41:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-01-09 21:41:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:44,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:44,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:44,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:44,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:44,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-01-09 21:41:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540273047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:44,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:44,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:44,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109995683] [2025-01-09 21:41:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:44,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:44,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:44,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:45,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1259 out of 1512 [2025-01-09 21:41:45,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 364 transitions, 2451 flow. Second operand has 3 states, 3 states have (on average 1260.3333333333333) internal successors, (3781), 3 states have internal predecessors, (3781), 0 states have call successors, (0), 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-01-09 21:41:45,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:45,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1259 of 1512 [2025-01-09 21:41:45,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:45,519 INFO L124 PetriNetUnfolderBase]: 83/2038 cut-off events. [2025-01-09 21:41:45,519 INFO L125 PetriNetUnfolderBase]: For 12301/12301 co-relation queries the response was YES. [2025-01-09 21:41:45,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 2038 events. 83/2038 cut-off events. For 12301/12301 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 5603 event pairs, 41 based on Foata normal form. 1/1870 useless extension candidates. Maximal degree in co-relation 3174. Up to 293 conditions per place. [2025-01-09 21:41:45,552 INFO L140 encePairwiseOnDemand]: 1507/1512 looper letters, 50 selfloop transitions, 2 changer transitions 1/361 dead transitions. [2025-01-09 21:41:45,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 361 transitions, 2549 flow [2025-01-09 21:41:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3832 transitions. [2025-01-09 21:41:45,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447971781305115 [2025-01-09 21:41:45,554 INFO L175 Difference]: Start difference. First operand has 444 places, 364 transitions, 2451 flow. Second operand 3 states and 3832 transitions. [2025-01-09 21:41:45,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 361 transitions, 2549 flow [2025-01-09 21:41:45,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 361 transitions, 1066 flow, removed 741 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:45,569 INFO L231 Difference]: Finished difference. Result has 444 places, 360 transitions, 964 flow [2025-01-09 21:41:45,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1512, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=444, PETRI_TRANSITIONS=360} [2025-01-09 21:41:45,569 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, 0 predicate places. [2025-01-09 21:41:45,570 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 360 transitions, 964 flow [2025-01-09 21:41:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1260.3333333333333) internal successors, (3781), 3 states have internal predecessors, (3781), 0 states have call successors, (0), 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-01-09 21:41:45,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:45,570 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] [2025-01-09 21:41:45,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-01-09 21:41:45,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1343258039, now seen corresponding path program 1 times [2025-01-09 21:41:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050224267] [2025-01-09 21:41:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:45,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:45,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:45,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050224267] [2025-01-09 21:41:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050224267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662871809] [2025-01-09 21:41:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:45,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:45,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:45,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:45,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:45,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1177 out of 1512 [2025-01-09 21:41:45,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 360 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 1178.0) internal successors, (3534), 3 states have internal predecessors, (3534), 0 states have call successors, (0), 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-01-09 21:41:45,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:45,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1177 of 1512 [2025-01-09 21:41:45,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:46,183 INFO L124 PetriNetUnfolderBase]: 42/1829 cut-off events. [2025-01-09 21:41:46,183 INFO L125 PetriNetUnfolderBase]: For 899/899 co-relation queries the response was YES. [2025-01-09 21:41:46,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 1829 events. 42/1829 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4115 event pairs, 0 based on Foata normal form. 41/1787 useless extension candidates. Maximal degree in co-relation 2222. Up to 210 conditions per place. [2025-01-09 21:41:46,214 INFO L140 encePairwiseOnDemand]: 1506/1512 looper letters, 48 selfloop transitions, 1 changer transitions 24/355 dead transitions. [2025-01-09 21:41:46,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 355 transitions, 1056 flow [2025-01-09 21:41:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3587 transitions. [2025-01-09 21:41:46,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7907848324514991 [2025-01-09 21:41:46,217 INFO L175 Difference]: Start difference. First operand has 444 places, 360 transitions, 964 flow. Second operand 3 states and 3587 transitions. [2025-01-09 21:41:46,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 355 transitions, 1056 flow [2025-01-09 21:41:46,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 355 transitions, 1052 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:46,221 INFO L231 Difference]: Finished difference. Result has 438 places, 331 transitions, 902 flow [2025-01-09 21:41:46,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1512, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=438, PETRI_TRANSITIONS=331} [2025-01-09 21:41:46,221 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, -6 predicate places. [2025-01-09 21:41:46,221 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 331 transitions, 902 flow [2025-01-09 21:41:46,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1178.0) internal successors, (3534), 3 states have internal predecessors, (3534), 0 states have call successors, (0), 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-01-09 21:41:46,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:46,222 INFO L206 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:46,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2025-01-09 21:41:46,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:46,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 485444428, now seen corresponding path program 1 times [2025-01-09 21:41:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324767857] [2025-01-09 21:41:46,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:46,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 21:41:46,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 21:41:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324767857] [2025-01-09 21:41:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324767857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670131049] [2025-01-09 21:41:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:46,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1297 out of 1512 [2025-01-09 21:41:46,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 331 transitions, 902 flow. Second operand has 5 states, 5 states have (on average 1307.0) internal successors, (6535), 5 states have internal predecessors, (6535), 0 states have call successors, (0), 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-01-09 21:41:46,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:46,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1297 of 1512 [2025-01-09 21:41:46,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:46,809 INFO L124 PetriNetUnfolderBase]: 0/858 cut-off events. [2025-01-09 21:41:46,809 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2025-01-09 21:41:46,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 858 events. 0/858 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 507 event pairs, 0 based on Foata normal form. 1/858 useless extension candidates. Maximal degree in co-relation 0. Up to 128 conditions per place. [2025-01-09 21:41:46,810 INFO L140 encePairwiseOnDemand]: 1507/1512 looper letters, 48 selfloop transitions, 2 changer transitions 3/333 dead transitions. [2025-01-09 21:41:46,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 333 transitions, 1012 flow [2025-01-09 21:41:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6539 transitions. [2025-01-09 21:41:46,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8649470899470899 [2025-01-09 21:41:46,812 INFO L175 Difference]: Start difference. First operand has 438 places, 331 transitions, 902 flow. Second operand 5 states and 6539 transitions. [2025-01-09 21:41:46,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 333 transitions, 1012 flow [2025-01-09 21:41:46,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 333 transitions, 1011 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:46,815 INFO L231 Difference]: Finished difference. Result has 418 places, 330 transitions, 907 flow [2025-01-09 21:41:46,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1512, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=907, PETRI_PLACES=418, PETRI_TRANSITIONS=330} [2025-01-09 21:41:46,818 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, -26 predicate places. [2025-01-09 21:41:46,818 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 330 transitions, 907 flow [2025-01-09 21:41:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1307.0) internal successors, (6535), 5 states have internal predecessors, (6535), 0 states have call successors, (0), 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-01-09 21:41:46,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:46,819 INFO L206 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-01-09 21:41:46,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:41:46,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1469167107, now seen corresponding path program 1 times [2025-01-09 21:41:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:46,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596816077] [2025-01-09 21:41:46,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 21:41:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 21:41:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:46,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:46,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-01-09 21:41:46,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-01-09 21:41:46,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:46,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:47,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:47,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:47,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 48 remaining) [2025-01-09 21:41:47,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-01-09 21:41:47,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-01-09 21:41:47,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-01-09 21:41:47,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-01-09 21:41:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-01-09 21:41:47,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:47,059 WARN L246 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:47,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2025-01-09 21:41:47,177 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:47,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1588 places, 1548 transitions, 6704 flow [2025-01-09 21:41:47,649 INFO L124 PetriNetUnfolderBase]: 170/2677 cut-off events. [2025-01-09 21:41:47,649 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2025-01-09 21:41:47,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 2677 events. 170/2677 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7714 event pairs, 0 based on Foata normal form. 0/2377 useless extension candidates. Maximal degree in co-relation 3663. Up to 84 conditions per place. [2025-01-09 21:41:47,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 1588 places, 1548 transitions, 6704 flow [2025-01-09 21:41:47,716 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 453 places, 371 transitions, 2549 flow [2025-01-09 21:41:47,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:47,716 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:47,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-09 21:41:47,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:47,717 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:47,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:47,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:47,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:47,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:47,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1626287299, now seen corresponding path program 1 times [2025-01-09 21:41:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073593440] [2025-01-09 21:41:47,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:47,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:47,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:47,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073593440] [2025-01-09 21:41:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073593440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427332577] [2025-01-09 21:41:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:47,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:47,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:47,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:47,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1289 out of 1548 [2025-01-09 21:41:47,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 371 transitions, 2549 flow. Second operand has 3 states, 3 states have (on average 1290.3333333333333) internal successors, (3871), 3 states have internal predecessors, (3871), 0 states have call successors, (0), 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-01-09 21:41:47,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:47,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1289 of 1548 [2025-01-09 21:41:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:48,336 INFO L124 PetriNetUnfolderBase]: 85/2087 cut-off events. [2025-01-09 21:41:48,336 INFO L125 PetriNetUnfolderBase]: For 13203/13203 co-relation queries the response was YES. [2025-01-09 21:41:48,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 2087 events. 85/2087 cut-off events. For 13203/13203 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5525 event pairs, 42 based on Foata normal form. 1/1915 useless extension candidates. Maximal degree in co-relation 3273. Up to 300 conditions per place. [2025-01-09 21:41:48,381 INFO L140 encePairwiseOnDemand]: 1543/1548 looper letters, 51 selfloop transitions, 2 changer transitions 1/368 dead transitions. [2025-01-09 21:41:48,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 368 transitions, 2649 flow [2025-01-09 21:41:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3923 transitions. [2025-01-09 21:41:48,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.844745908699397 [2025-01-09 21:41:48,383 INFO L175 Difference]: Start difference. First operand has 453 places, 371 transitions, 2549 flow. Second operand 3 states and 3923 transitions. [2025-01-09 21:41:48,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 368 transitions, 2649 flow [2025-01-09 21:41:48,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 368 transitions, 1088 flow, removed 780 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:48,398 INFO L231 Difference]: Finished difference. Result has 453 places, 367 transitions, 984 flow [2025-01-09 21:41:48,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1548, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=984, PETRI_PLACES=453, PETRI_TRANSITIONS=367} [2025-01-09 21:41:48,398 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 0 predicate places. [2025-01-09 21:41:48,398 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 367 transitions, 984 flow [2025-01-09 21:41:48,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1290.3333333333333) internal successors, (3871), 3 states have internal predecessors, (3871), 0 states have call successors, (0), 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-01-09 21:41:48,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:48,399 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] [2025-01-09 21:41:48,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-01-09 21:41:48,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:48,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash 113520969, now seen corresponding path program 1 times [2025-01-09 21:41:48,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:48,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-01-09 21:41:48,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:48,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:48,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:48,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:48,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140840500] [2025-01-09 21:41:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140840500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951240409] [2025-01-09 21:41:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:48,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:48,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:48,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:48,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:48,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1205 out of 1548 [2025-01-09 21:41:48,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 367 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 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-01-09 21:41:48,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:48,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1205 of 1548 [2025-01-09 21:41:48,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:48,860 INFO L124 PetriNetUnfolderBase]: 43/1873 cut-off events. [2025-01-09 21:41:48,860 INFO L125 PetriNetUnfolderBase]: For 942/942 co-relation queries the response was YES. [2025-01-09 21:41:48,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 1873 events. 43/1873 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4133 event pairs, 0 based on Foata normal form. 42/1830 useless extension candidates. Maximal degree in co-relation 2276. Up to 215 conditions per place. [2025-01-09 21:41:48,896 INFO L140 encePairwiseOnDemand]: 1542/1548 looper letters, 49 selfloop transitions, 1 changer transitions 24/362 dead transitions. [2025-01-09 21:41:48,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 362 transitions, 1078 flow [2025-01-09 21:41:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3672 transitions. [2025-01-09 21:41:48,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7906976744186046 [2025-01-09 21:41:48,897 INFO L175 Difference]: Start difference. First operand has 453 places, 367 transitions, 984 flow. Second operand 3 states and 3672 transitions. [2025-01-09 21:41:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 362 transitions, 1078 flow [2025-01-09 21:41:48,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 362 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:48,900 INFO L231 Difference]: Finished difference. Result has 447 places, 338 transitions, 922 flow [2025-01-09 21:41:48,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1548, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=447, PETRI_TRANSITIONS=338} [2025-01-09 21:41:48,901 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -6 predicate places. [2025-01-09 21:41:48,901 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 338 transitions, 922 flow [2025-01-09 21:41:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1206.0) internal successors, (3618), 3 states have internal predecessors, (3618), 0 states have call successors, (0), 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-01-09 21:41:48,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:48,901 INFO L206 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:48,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2025-01-09 21:41:48,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash 276017605, now seen corresponding path program 1 times [2025-01-09 21:41:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-01-09 21:41:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:48,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 21:41:48,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 21:41:48,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:48,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-01-09 21:41:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355369288] [2025-01-09 21:41:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:49,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:49,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:49,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1328 out of 1548 [2025-01-09 21:41:49,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 338 transitions, 922 flow. Second operand has 5 states, 5 states have (on average 1338.2) internal successors, (6691), 5 states have internal predecessors, (6691), 0 states have call successors, (0), 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-01-09 21:41:49,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:49,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1328 of 1548 [2025-01-09 21:41:49,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:49,386 INFO L124 PetriNetUnfolderBase]: 0/878 cut-off events. [2025-01-09 21:41:49,387 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2025-01-09 21:41:49,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 878 events. 0/878 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 519 event pairs, 0 based on Foata normal form. 1/878 useless extension candidates. Maximal degree in co-relation 0. Up to 131 conditions per place. [2025-01-09 21:41:49,388 INFO L140 encePairwiseOnDemand]: 1543/1548 looper letters, 49 selfloop transitions, 2 changer transitions 3/340 dead transitions. [2025-01-09 21:41:49,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 340 transitions, 1034 flow [2025-01-09 21:41:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6695 transitions. [2025-01-09 21:41:49,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8649870801033591 [2025-01-09 21:41:49,390 INFO L175 Difference]: Start difference. First operand has 447 places, 338 transitions, 922 flow. Second operand 5 states and 6695 transitions. [2025-01-09 21:41:49,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 340 transitions, 1034 flow [2025-01-09 21:41:49,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 340 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:49,393 INFO L231 Difference]: Finished difference. Result has 427 places, 337 transitions, 927 flow [2025-01-09 21:41:49,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1548, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=927, PETRI_PLACES=427, PETRI_TRANSITIONS=337} [2025-01-09 21:41:49,393 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -26 predicate places. [2025-01-09 21:41:49,393 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 337 transitions, 927 flow [2025-01-09 21:41:49,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1338.2) internal successors, (6691), 5 states have internal predecessors, (6691), 0 states have call successors, (0), 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-01-09 21:41:49,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:49,394 INFO L206 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-01-09 21:41:49,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:41:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -477841872, now seen corresponding path program 1 times [2025-01-09 21:41:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-01-09 21:41:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:49,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-09 21:41:49,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-09 21:41:49,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:49,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:49,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-09 21:41:49,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-09 21:41:49,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:49,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:49,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:49,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-01-09 21:41:49,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-01-09 21:41:49,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-01-09 21:41:49,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2025-01-09 21:41:49,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:49,647 WARN L246 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:49,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2025-01-09 21:41:49,769 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1625 places, 1584 transitions, 6948 flow [2025-01-09 21:41:50,301 INFO L124 PetriNetUnfolderBase]: 174/2740 cut-off events. [2025-01-09 21:41:50,302 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2025-01-09 21:41:50,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 2740 events. 174/2740 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7855 event pairs, 0 based on Foata normal form. 0/2433 useless extension candidates. Maximal degree in co-relation 3771. Up to 86 conditions per place. [2025-01-09 21:41:50,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 1625 places, 1584 transitions, 6948 flow [2025-01-09 21:41:50,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 462 places, 378 transitions, 2649 flow [2025-01-09 21:41:50,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:50,345 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:50,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:41:50,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:50,346 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:50,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:50,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:50,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:50,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:50,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 925588675, now seen corresponding path program 1 times [2025-01-09 21:41:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768695099] [2025-01-09 21:41:50,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:50,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:50,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:50,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:50,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:50,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768695099] [2025-01-09 21:41:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768695099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:50,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:50,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373904381] [2025-01-09 21:41:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:50,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:50,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:50,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:50,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1319 out of 1584 [2025-01-09 21:41:50,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 378 transitions, 2649 flow. Second operand has 3 states, 3 states have (on average 1320.3333333333333) internal successors, (3961), 3 states have internal predecessors, (3961), 0 states have call successors, (0), 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-01-09 21:41:50,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:50,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1319 of 1584 [2025-01-09 21:41:50,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:51,066 INFO L124 PetriNetUnfolderBase]: 87/2136 cut-off events. [2025-01-09 21:41:51,066 INFO L125 PetriNetUnfolderBase]: For 14148/14148 co-relation queries the response was YES. [2025-01-09 21:41:51,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 2136 events. 87/2136 cut-off events. For 14148/14148 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5675 event pairs, 43 based on Foata normal form. 1/1960 useless extension candidates. Maximal degree in co-relation 3373. Up to 307 conditions per place. [2025-01-09 21:41:51,118 INFO L140 encePairwiseOnDemand]: 1579/1584 looper letters, 52 selfloop transitions, 2 changer transitions 1/375 dead transitions. [2025-01-09 21:41:51,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 375 transitions, 2751 flow [2025-01-09 21:41:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4014 transitions. [2025-01-09 21:41:51,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446969696969697 [2025-01-09 21:41:51,121 INFO L175 Difference]: Start difference. First operand has 462 places, 378 transitions, 2649 flow. Second operand 3 states and 4014 transitions. [2025-01-09 21:41:51,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 375 transitions, 2751 flow [2025-01-09 21:41:51,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 375 transitions, 1110 flow, removed 820 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:51,142 INFO L231 Difference]: Finished difference. Result has 462 places, 374 transitions, 1004 flow [2025-01-09 21:41:51,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1584, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=462, PETRI_TRANSITIONS=374} [2025-01-09 21:41:51,142 INFO L279 CegarLoopForPetriNet]: 462 programPoint places, 0 predicate places. [2025-01-09 21:41:51,142 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 374 transitions, 1004 flow [2025-01-09 21:41:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1320.3333333333333) internal successors, (3961), 3 states have internal predecessors, (3961), 0 states have call successors, (0), 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-01-09 21:41:51,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:51,143 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] [2025-01-09 21:41:51,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-01-09 21:41:51,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 105934153, now seen corresponding path program 1 times [2025-01-09 21:41:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609037441] [2025-01-09 21:41:51,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:51,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:51,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:51,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:51,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:51,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:51,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609037441] [2025-01-09 21:41:51,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609037441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341690196] [2025-01-09 21:41:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:51,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:51,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:51,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1233 out of 1584 [2025-01-09 21:41:51,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 374 transitions, 1004 flow. Second operand has 3 states, 3 states have (on average 1234.0) internal successors, (3702), 3 states have internal predecessors, (3702), 0 states have call successors, (0), 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-01-09 21:41:51,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:51,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1233 of 1584 [2025-01-09 21:41:51,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:51,844 INFO L124 PetriNetUnfolderBase]: 44/1917 cut-off events. [2025-01-09 21:41:51,845 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2025-01-09 21:41:51,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1917 events. 44/1917 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4234 event pairs, 0 based on Foata normal form. 43/1873 useless extension candidates. Maximal degree in co-relation 2330. Up to 220 conditions per place. [2025-01-09 21:41:51,884 INFO L140 encePairwiseOnDemand]: 1578/1584 looper letters, 50 selfloop transitions, 1 changer transitions 24/369 dead transitions. [2025-01-09 21:41:51,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 369 transitions, 1100 flow [2025-01-09 21:41:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3757 transitions. [2025-01-09 21:41:51,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7906144781144782 [2025-01-09 21:41:51,887 INFO L175 Difference]: Start difference. First operand has 462 places, 374 transitions, 1004 flow. Second operand 3 states and 3757 transitions. [2025-01-09 21:41:51,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 369 transitions, 1100 flow [2025-01-09 21:41:51,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 369 transitions, 1096 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:51,891 INFO L231 Difference]: Finished difference. Result has 456 places, 345 transitions, 942 flow [2025-01-09 21:41:51,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1584, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=942, PETRI_PLACES=456, PETRI_TRANSITIONS=345} [2025-01-09 21:41:51,891 INFO L279 CegarLoopForPetriNet]: 462 programPoint places, -6 predicate places. [2025-01-09 21:41:51,891 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 345 transitions, 942 flow [2025-01-09 21:41:51,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1234.0) internal successors, (3702), 3 states have internal predecessors, (3702), 0 states have call successors, (0), 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-01-09 21:41:51,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:51,892 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:51,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-01-09 21:41:51,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:51,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1520349609, now seen corresponding path program 1 times [2025-01-09 21:41:51,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:51,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902850277] [2025-01-09 21:41:51,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:51,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-01-09 21:41:51,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-01-09 21:41:51,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902850277] [2025-01-09 21:41:52,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902850277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:52,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:52,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:52,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685366177] [2025-01-09 21:41:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:52,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:52,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:52,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:52,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1359 out of 1584 [2025-01-09 21:41:52,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 345 transitions, 942 flow. Second operand has 5 states, 5 states have (on average 1369.4) internal successors, (6847), 5 states have internal predecessors, (6847), 0 states have call successors, (0), 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-01-09 21:41:52,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:52,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1359 of 1584 [2025-01-09 21:41:52,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:52,542 INFO L124 PetriNetUnfolderBase]: 0/898 cut-off events. [2025-01-09 21:41:52,542 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2025-01-09 21:41:52,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 898 events. 0/898 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 530 event pairs, 0 based on Foata normal form. 1/898 useless extension candidates. Maximal degree in co-relation 0. Up to 134 conditions per place. [2025-01-09 21:41:52,543 INFO L140 encePairwiseOnDemand]: 1579/1584 looper letters, 50 selfloop transitions, 2 changer transitions 3/347 dead transitions. [2025-01-09 21:41:52,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 347 transitions, 1056 flow [2025-01-09 21:41:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6851 transitions. [2025-01-09 21:41:52,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650252525252525 [2025-01-09 21:41:52,547 INFO L175 Difference]: Start difference. First operand has 456 places, 345 transitions, 942 flow. Second operand 5 states and 6851 transitions. [2025-01-09 21:41:52,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 347 transitions, 1056 flow [2025-01-09 21:41:52,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 347 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:52,552 INFO L231 Difference]: Finished difference. Result has 436 places, 344 transitions, 947 flow [2025-01-09 21:41:52,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1584, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=947, PETRI_PLACES=436, PETRI_TRANSITIONS=344} [2025-01-09 21:41:52,552 INFO L279 CegarLoopForPetriNet]: 462 programPoint places, -26 predicate places. [2025-01-09 21:41:52,552 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 344 transitions, 947 flow [2025-01-09 21:41:52,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1369.4) internal successors, (6847), 5 states have internal predecessors, (6847), 0 states have call successors, (0), 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-01-09 21:41:52,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:52,553 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:52,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-01-09 21:41:52,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:41:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash 349396132, now seen corresponding path program 1 times [2025-01-09 21:41:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040772647] [2025-01-09 21:41:52,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:52,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 21:41:52,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 21:41:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:52,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:52,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 21:41:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 21:41:52,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:52,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:52,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:52,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:52,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-01-09 21:41:52,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-01-09 21:41:52,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-01-09 21:41:52,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-01-09 21:41:52,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-01-09 21:41:52,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-01-09 21:41:52,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2025-01-09 21:41:52,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:52,919 WARN L246 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:52,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2025-01-09 21:41:53,044 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:53,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1662 places, 1620 transitions, 7196 flow [2025-01-09 21:41:53,529 INFO L124 PetriNetUnfolderBase]: 178/2803 cut-off events. [2025-01-09 21:41:53,529 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2025-01-09 21:41:53,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2803 events. 178/2803 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8104 event pairs, 0 based on Foata normal form. 0/2489 useless extension candidates. Maximal degree in co-relation 3880. Up to 88 conditions per place. [2025-01-09 21:41:53,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 1662 places, 1620 transitions, 7196 flow [2025-01-09 21:41:53,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 471 places, 385 transitions, 2751 flow [2025-01-09 21:41:53,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:53,603 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:53,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:41:53,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:53,604 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:53,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:53,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:53,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:53,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:53,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash 989868227, now seen corresponding path program 1 times [2025-01-09 21:41:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282927808] [2025-01-09 21:41:53,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:53,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:53,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:53,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:53,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282927808] [2025-01-09 21:41:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282927808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003128665] [2025-01-09 21:41:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:53,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:53,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:53,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:53,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1349 out of 1620 [2025-01-09 21:41:53,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 385 transitions, 2751 flow. Second operand has 3 states, 3 states have (on average 1350.3333333333333) internal successors, (4051), 3 states have internal predecessors, (4051), 0 states have call successors, (0), 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-01-09 21:41:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1349 of 1620 [2025-01-09 21:41:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:54,218 INFO L124 PetriNetUnfolderBase]: 89/2185 cut-off events. [2025-01-09 21:41:54,218 INFO L125 PetriNetUnfolderBase]: For 15137/15137 co-relation queries the response was YES. [2025-01-09 21:41:54,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 2185 events. 89/2185 cut-off events. For 15137/15137 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6027 event pairs, 44 based on Foata normal form. 1/2005 useless extension candidates. Maximal degree in co-relation 3474. Up to 314 conditions per place. [2025-01-09 21:41:54,267 INFO L140 encePairwiseOnDemand]: 1615/1620 looper letters, 53 selfloop transitions, 2 changer transitions 1/382 dead transitions. [2025-01-09 21:41:54,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 382 transitions, 2855 flow [2025-01-09 21:41:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4105 transitions. [2025-01-09 21:41:54,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446502057613169 [2025-01-09 21:41:54,268 INFO L175 Difference]: Start difference. First operand has 471 places, 385 transitions, 2751 flow. Second operand 3 states and 4105 transitions. [2025-01-09 21:41:54,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 382 transitions, 2855 flow [2025-01-09 21:41:54,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 382 transitions, 1132 flow, removed 861 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:54,287 INFO L231 Difference]: Finished difference. Result has 471 places, 381 transitions, 1024 flow [2025-01-09 21:41:54,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1620, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=471, PETRI_TRANSITIONS=381} [2025-01-09 21:41:54,287 INFO L279 CegarLoopForPetriNet]: 471 programPoint places, 0 predicate places. [2025-01-09 21:41:54,287 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 381 transitions, 1024 flow [2025-01-09 21:41:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1350.3333333333333) internal successors, (4051), 3 states have internal predecessors, (4051), 0 states have call successors, (0), 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-01-09 21:41:54,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:54,287 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] [2025-01-09 21:41:54,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-01-09 21:41:54,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1366018487, now seen corresponding path program 1 times [2025-01-09 21:41:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398941588] [2025-01-09 21:41:54,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:54,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:54,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398941588] [2025-01-09 21:41:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398941588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:54,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458645959] [2025-01-09 21:41:54,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:54,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:54,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:54,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:54,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:54,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1261 out of 1620 [2025-01-09 21:41:54,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 381 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 1262.0) internal successors, (3786), 3 states have internal predecessors, (3786), 0 states have call successors, (0), 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-01-09 21:41:54,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:54,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1261 of 1620 [2025-01-09 21:41:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:54,864 INFO L124 PetriNetUnfolderBase]: 45/1961 cut-off events. [2025-01-09 21:41:54,864 INFO L125 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-01-09 21:41:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1961 events. 45/1961 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4465 event pairs, 0 based on Foata normal form. 44/1916 useless extension candidates. Maximal degree in co-relation 2384. Up to 225 conditions per place. [2025-01-09 21:41:54,880 INFO L140 encePairwiseOnDemand]: 1614/1620 looper letters, 51 selfloop transitions, 1 changer transitions 24/376 dead transitions. [2025-01-09 21:41:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 376 transitions, 1122 flow [2025-01-09 21:41:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3842 transitions. [2025-01-09 21:41:54,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7905349794238683 [2025-01-09 21:41:54,882 INFO L175 Difference]: Start difference. First operand has 471 places, 381 transitions, 1024 flow. Second operand 3 states and 3842 transitions. [2025-01-09 21:41:54,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 376 transitions, 1122 flow [2025-01-09 21:41:54,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 376 transitions, 1118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:54,885 INFO L231 Difference]: Finished difference. Result has 465 places, 352 transitions, 962 flow [2025-01-09 21:41:54,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1620, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=465, PETRI_TRANSITIONS=352} [2025-01-09 21:41:54,886 INFO L279 CegarLoopForPetriNet]: 471 programPoint places, -6 predicate places. [2025-01-09 21:41:54,886 INFO L471 AbstractCegarLoop]: Abstraction has has 465 places, 352 transitions, 962 flow [2025-01-09 21:41:54,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1262.0) internal successors, (3786), 3 states have internal predecessors, (3786), 0 states have call successors, (0), 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-01-09 21:41:54,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:54,886 INFO L206 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:54,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2025-01-09 21:41:54,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -530408712, now seen corresponding path program 1 times [2025-01-09 21:41:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672045732] [2025-01-09 21:41:54,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:54,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 21:41:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 21:41:54,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:54,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672045732] [2025-01-09 21:41:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672045732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638080] [2025-01-09 21:41:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:55,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:55,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:55,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1390 out of 1620 [2025-01-09 21:41:55,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 352 transitions, 962 flow. Second operand has 5 states, 5 states have (on average 1400.6) internal successors, (7003), 5 states have internal predecessors, (7003), 0 states have call successors, (0), 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-01-09 21:41:55,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:55,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1390 of 1620 [2025-01-09 21:41:55,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:55,342 INFO L124 PetriNetUnfolderBase]: 0/918 cut-off events. [2025-01-09 21:41:55,342 INFO L125 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-01-09 21:41:55,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 918 events. 0/918 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 543 event pairs, 0 based on Foata normal form. 1/918 useless extension candidates. Maximal degree in co-relation 0. Up to 137 conditions per place. [2025-01-09 21:41:55,343 INFO L140 encePairwiseOnDemand]: 1615/1620 looper letters, 51 selfloop transitions, 2 changer transitions 3/354 dead transitions. [2025-01-09 21:41:55,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 354 transitions, 1078 flow [2025-01-09 21:41:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7007 transitions. [2025-01-09 21:41:55,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650617283950617 [2025-01-09 21:41:55,346 INFO L175 Difference]: Start difference. First operand has 465 places, 352 transitions, 962 flow. Second operand 5 states and 7007 transitions. [2025-01-09 21:41:55,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 354 transitions, 1078 flow [2025-01-09 21:41:55,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 354 transitions, 1077 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:55,349 INFO L231 Difference]: Finished difference. Result has 445 places, 351 transitions, 967 flow [2025-01-09 21:41:55,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1620, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=967, PETRI_PLACES=445, PETRI_TRANSITIONS=351} [2025-01-09 21:41:55,349 INFO L279 CegarLoopForPetriNet]: 471 programPoint places, -26 predicate places. [2025-01-09 21:41:55,349 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 351 transitions, 967 flow [2025-01-09 21:41:55,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1400.6) internal successors, (7003), 5 states have internal predecessors, (7003), 0 states have call successors, (0), 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-01-09 21:41:55,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:55,350 INFO L206 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-01-09 21:41:55,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-01-09 21:41:55,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2034050655, now seen corresponding path program 1 times [2025-01-09 21:41:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-01-09 21:41:55,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-01-09 21:41:55,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-01-09 21:41:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:55,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes. [2025-01-09 21:41:55,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements. [2025-01-09 21:41:55,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:55,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:55,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:55,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:55,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-01-09 21:41:55,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-01-09 21:41:55,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-01-09 21:41:55,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-01-09 21:41:55,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-01-09 21:41:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-01-09 21:41:55,633 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:55,634 WARN L246 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:55,634 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2025-01-09 21:41:55,754 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:55,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1699 places, 1656 transitions, 7448 flow [2025-01-09 21:41:56,263 INFO L124 PetriNetUnfolderBase]: 182/2866 cut-off events. [2025-01-09 21:41:56,263 INFO L125 PetriNetUnfolderBase]: For 15136/15136 co-relation queries the response was YES. [2025-01-09 21:41:56,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 2866 events. 182/2866 cut-off events. For 15136/15136 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8246 event pairs, 0 based on Foata normal form. 0/2545 useless extension candidates. Maximal degree in co-relation 3990. Up to 90 conditions per place. [2025-01-09 21:41:56,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 1699 places, 1656 transitions, 7448 flow [2025-01-09 21:41:56,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 480 places, 392 transitions, 2855 flow [2025-01-09 21:41:56,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:56,336 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:56,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-09 21:41:56,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:56,337 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:56,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:56,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:56,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:56,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:56,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1819125955, now seen corresponding path program 1 times [2025-01-09 21:41:56,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:56,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882540542] [2025-01-09 21:41:56,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:56,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:56,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:56,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882540542] [2025-01-09 21:41:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882540542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467826043] [2025-01-09 21:41:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:56,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:56,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1379 out of 1656 [2025-01-09 21:41:56,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 392 transitions, 2855 flow. Second operand has 3 states, 3 states have (on average 1380.3333333333333) internal successors, (4141), 3 states have internal predecessors, (4141), 0 states have call successors, (0), 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-01-09 21:41:56,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:56,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1379 of 1656 [2025-01-09 21:41:56,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:57,014 INFO L124 PetriNetUnfolderBase]: 91/2234 cut-off events. [2025-01-09 21:41:57,014 INFO L125 PetriNetUnfolderBase]: For 16171/16171 co-relation queries the response was YES. [2025-01-09 21:41:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3727 conditions, 2234 events. 91/2234 cut-off events. For 16171/16171 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 5914 event pairs, 45 based on Foata normal form. 1/2050 useless extension candidates. Maximal degree in co-relation 3577. Up to 321 conditions per place. [2025-01-09 21:41:57,055 INFO L140 encePairwiseOnDemand]: 1651/1656 looper letters, 54 selfloop transitions, 2 changer transitions 1/389 dead transitions. [2025-01-09 21:41:57,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 389 transitions, 2961 flow [2025-01-09 21:41:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4196 transitions. [2025-01-09 21:41:57,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8446054750402576 [2025-01-09 21:41:57,056 INFO L175 Difference]: Start difference. First operand has 480 places, 392 transitions, 2855 flow. Second operand 3 states and 4196 transitions. [2025-01-09 21:41:57,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 389 transitions, 2961 flow [2025-01-09 21:41:57,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 389 transitions, 1154 flow, removed 903 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:57,074 INFO L231 Difference]: Finished difference. Result has 480 places, 388 transitions, 1044 flow [2025-01-09 21:41:57,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1656, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=480, PETRI_TRANSITIONS=388} [2025-01-09 21:41:57,075 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, 0 predicate places. [2025-01-09 21:41:57,075 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 388 transitions, 1044 flow [2025-01-09 21:41:57,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1380.3333333333333) internal successors, (4141), 3 states have internal predecessors, (4141), 0 states have call successors, (0), 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-01-09 21:41:57,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:57,075 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] [2025-01-09 21:41:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-01-09 21:41:57,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:57,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -7369655, now seen corresponding path program 1 times [2025-01-09 21:41:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-01-09 21:41:57,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:57,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:41:57,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:41:57,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:57,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-01-09 21:41:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890869708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:57,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890939036] [2025-01-09 21:41:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:57,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:57,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1289 out of 1656 [2025-01-09 21:41:57,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 388 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 1290.0) internal successors, (3870), 3 states have internal predecessors, (3870), 0 states have call successors, (0), 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-01-09 21:41:57,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:57,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1289 of 1656 [2025-01-09 21:41:57,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:57,642 INFO L124 PetriNetUnfolderBase]: 46/2005 cut-off events. [2025-01-09 21:41:57,642 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2025-01-09 21:41:57,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 2005 events. 46/2005 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4433 event pairs, 0 based on Foata normal form. 45/1959 useless extension candidates. Maximal degree in co-relation 2438. Up to 230 conditions per place. [2025-01-09 21:41:57,683 INFO L140 encePairwiseOnDemand]: 1650/1656 looper letters, 52 selfloop transitions, 1 changer transitions 24/383 dead transitions. [2025-01-09 21:41:57,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 383 transitions, 1144 flow [2025-01-09 21:41:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:41:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3927 transitions. [2025-01-09 21:41:57,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904589371980676 [2025-01-09 21:41:57,685 INFO L175 Difference]: Start difference. First operand has 480 places, 388 transitions, 1044 flow. Second operand 3 states and 3927 transitions. [2025-01-09 21:41:57,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 383 transitions, 1144 flow [2025-01-09 21:41:57,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 383 transitions, 1140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:41:57,688 INFO L231 Difference]: Finished difference. Result has 474 places, 359 transitions, 982 flow [2025-01-09 21:41:57,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1656, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=982, PETRI_PLACES=474, PETRI_TRANSITIONS=359} [2025-01-09 21:41:57,689 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -6 predicate places. [2025-01-09 21:41:57,689 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 359 transitions, 982 flow [2025-01-09 21:41:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1290.0) internal successors, (3870), 3 states have internal predecessors, (3870), 0 states have call successors, (0), 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-01-09 21:41:57,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:57,689 INFO L206 CegarLoopForPetriNet]: trace histogram [45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2025-01-09 21:41:57,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:57,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -523874894, now seen corresponding path program 1 times [2025-01-09 21:41:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472552] [2025-01-09 21:41:57,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:57,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-01-09 21:41:57,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-01-09 21:41:57,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:57,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120472552] [2025-01-09 21:41:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120472552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:57,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:57,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:41:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713783281] [2025-01-09 21:41:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:57,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:41:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:57,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:41:57,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:41:57,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1421 out of 1656 [2025-01-09 21:41:57,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 359 transitions, 982 flow. Second operand has 5 states, 5 states have (on average 1431.8) internal successors, (7159), 5 states have internal predecessors, (7159), 0 states have call successors, (0), 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-01-09 21:41:57,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:57,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1421 of 1656 [2025-01-09 21:41:57,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:58,200 INFO L124 PetriNetUnfolderBase]: 0/938 cut-off events. [2025-01-09 21:41:58,200 INFO L125 PetriNetUnfolderBase]: For 1076/1076 co-relation queries the response was YES. [2025-01-09 21:41:58,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 938 events. 0/938 cut-off events. For 1076/1076 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 555 event pairs, 0 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 0. Up to 140 conditions per place. [2025-01-09 21:41:58,201 INFO L140 encePairwiseOnDemand]: 1651/1656 looper letters, 52 selfloop transitions, 2 changer transitions 3/361 dead transitions. [2025-01-09 21:41:58,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 361 transitions, 1100 flow [2025-01-09 21:41:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:41:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:41:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7163 transitions. [2025-01-09 21:41:58,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865096618357488 [2025-01-09 21:41:58,203 INFO L175 Difference]: Start difference. First operand has 474 places, 359 transitions, 982 flow. Second operand 5 states and 7163 transitions. [2025-01-09 21:41:58,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 361 transitions, 1100 flow [2025-01-09 21:41:58,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 361 transitions, 1099 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:41:58,206 INFO L231 Difference]: Finished difference. Result has 454 places, 358 transitions, 987 flow [2025-01-09 21:41:58,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1656, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=987, PETRI_PLACES=454, PETRI_TRANSITIONS=358} [2025-01-09 21:41:58,207 INFO L279 CegarLoopForPetriNet]: 480 programPoint places, -26 predicate places. [2025-01-09 21:41:58,207 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 358 transitions, 987 flow [2025-01-09 21:41:58,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1431.8) internal successors, (7159), 5 states have internal predecessors, (7159), 0 states have call successors, (0), 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-01-09 21:41:58,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:58,207 INFO L206 CegarLoopForPetriNet]: trace histogram [45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:41:58,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-01-09 21:41:58,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:41:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash 617652321, now seen corresponding path program 1 times [2025-01-09 21:41:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-01-09 21:41:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:58,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-01-09 21:41:58,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-01-09 21:41:58,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:58,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:58,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:41:58,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-01-09 21:41:58,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-01-09 21:41:58,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:41:58,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:41:58,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-01-09 21:41:58,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-01-09 21:41:58,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-01-09 21:41:58,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-01-09 21:41:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2025-01-09 21:41:58,505 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:41:58,506 WARN L246 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:41:58,506 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2025-01-09 21:41:58,625 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:41:58,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1736 places, 1692 transitions, 7704 flow [2025-01-09 21:41:59,209 INFO L124 PetriNetUnfolderBase]: 186/2929 cut-off events. [2025-01-09 21:41:59,210 INFO L125 PetriNetUnfolderBase]: For 16170/16170 co-relation queries the response was YES. [2025-01-09 21:41:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 2929 events. 186/2929 cut-off events. For 16170/16170 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8454 event pairs, 0 based on Foata normal form. 0/2601 useless extension candidates. Maximal degree in co-relation 4101. Up to 92 conditions per place. [2025-01-09 21:41:59,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 1736 places, 1692 transitions, 7704 flow [2025-01-09 21:41:59,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 489 places, 399 transitions, 2961 flow [2025-01-09 21:41:59,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:41:59,287 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:41:59,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-09 21:41:59,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:41:59,288 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:41:59,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:41:59,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:41:59,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:41:59,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:41:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:41:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -881605437, now seen corresponding path program 1 times [2025-01-09 21:41:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:41:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-01-09 21:41:59,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:41:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:41:59,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:41:59,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:41:59,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:41:59,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:41:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:41:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:41:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-01-09 21:41:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121043263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:41:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:41:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:41:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155331880] [2025-01-09 21:41:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:41:59,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:41:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:41:59,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:41:59,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:41:59,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1409 out of 1692 [2025-01-09 21:41:59,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 399 transitions, 2961 flow. Second operand has 3 states, 3 states have (on average 1410.3333333333333) internal successors, (4231), 3 states have internal predecessors, (4231), 0 states have call successors, (0), 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-01-09 21:41:59,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:41:59,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1409 of 1692 [2025-01-09 21:41:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:41:59,942 INFO L124 PetriNetUnfolderBase]: 93/2283 cut-off events. [2025-01-09 21:41:59,942 INFO L125 PetriNetUnfolderBase]: For 17251/17251 co-relation queries the response was YES. [2025-01-09 21:41:59,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3832 conditions, 2283 events. 93/2283 cut-off events. For 17251/17251 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6271 event pairs, 46 based on Foata normal form. 1/2095 useless extension candidates. Maximal degree in co-relation 3681. Up to 328 conditions per place. [2025-01-09 21:41:59,998 INFO L140 encePairwiseOnDemand]: 1687/1692 looper letters, 55 selfloop transitions, 2 changer transitions 1/396 dead transitions. [2025-01-09 21:41:59,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 396 transitions, 3069 flow [2025-01-09 21:41:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:41:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4287 transitions. [2025-01-09 21:42:00,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445626477541371 [2025-01-09 21:42:00,000 INFO L175 Difference]: Start difference. First operand has 489 places, 399 transitions, 2961 flow. Second operand 3 states and 4287 transitions. [2025-01-09 21:42:00,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 396 transitions, 3069 flow [2025-01-09 21:42:00,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 396 transitions, 1176 flow, removed 946 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:00,022 INFO L231 Difference]: Finished difference. Result has 489 places, 395 transitions, 1064 flow [2025-01-09 21:42:00,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1692, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=489, PETRI_TRANSITIONS=395} [2025-01-09 21:42:00,022 INFO L279 CegarLoopForPetriNet]: 489 programPoint places, 0 predicate places. [2025-01-09 21:42:00,022 INFO L471 AbstractCegarLoop]: Abstraction has has 489 places, 395 transitions, 1064 flow [2025-01-09 21:42:00,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1410.3333333333333) internal successors, (4231), 3 states have internal predecessors, (4231), 0 states have call successors, (0), 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-01-09 21:42:00,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:00,023 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] [2025-01-09 21:42:00,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-01-09 21:42:00,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:42:00,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash -113086647, now seen corresponding path program 1 times [2025-01-09 21:42:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793136151] [2025-01-09 21:42:00,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:00,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:00,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:00,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:00,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-01-09 21:42:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793136151] [2025-01-09 21:42:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793136151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286590249] [2025-01-09 21:42:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:00,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:00,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:00,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1317 out of 1692 [2025-01-09 21:42:00,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 395 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 1318.0) internal successors, (3954), 3 states have internal predecessors, (3954), 0 states have call successors, (0), 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-01-09 21:42:00,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:00,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1317 of 1692 [2025-01-09 21:42:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:00,576 INFO L124 PetriNetUnfolderBase]: 47/2049 cut-off events. [2025-01-09 21:42:00,576 INFO L125 PetriNetUnfolderBase]: For 1124/1124 co-relation queries the response was YES. [2025-01-09 21:42:00,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 2049 events. 47/2049 cut-off events. For 1124/1124 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4626 event pairs, 0 based on Foata normal form. 46/2002 useless extension candidates. Maximal degree in co-relation 2492. Up to 235 conditions per place. [2025-01-09 21:42:00,621 INFO L140 encePairwiseOnDemand]: 1686/1692 looper letters, 53 selfloop transitions, 1 changer transitions 24/390 dead transitions. [2025-01-09 21:42:00,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 390 transitions, 1166 flow [2025-01-09 21:42:00,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4012 transitions. [2025-01-09 21:42:00,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7903861308116628 [2025-01-09 21:42:00,622 INFO L175 Difference]: Start difference. First operand has 489 places, 395 transitions, 1064 flow. Second operand 3 states and 4012 transitions. [2025-01-09 21:42:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 390 transitions, 1166 flow [2025-01-09 21:42:00,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 390 transitions, 1162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:00,626 INFO L231 Difference]: Finished difference. Result has 483 places, 366 transitions, 1002 flow [2025-01-09 21:42:00,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1692, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1002, PETRI_PLACES=483, PETRI_TRANSITIONS=366} [2025-01-09 21:42:00,626 INFO L279 CegarLoopForPetriNet]: 489 programPoint places, -6 predicate places. [2025-01-09 21:42:00,626 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 366 transitions, 1002 flow [2025-01-09 21:42:00,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1318.0) internal successors, (3954), 3 states have internal predecessors, (3954), 0 states have call successors, (0), 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-01-09 21:42:00,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:00,627 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-01-09 21:42:00,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:42:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash 284506583, now seen corresponding path program 1 times [2025-01-09 21:42:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:00,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-01-09 21:42:00,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:00,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:42:00,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:42:00,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:00,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:00,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-01-09 21:42:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122397617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081161708] [2025-01-09 21:42:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:01,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1452 out of 1692 [2025-01-09 21:42:01,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 366 transitions, 1002 flow. Second operand has 5 states, 5 states have (on average 1463.0) internal successors, (7315), 5 states have internal predecessors, (7315), 0 states have call successors, (0), 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-01-09 21:42:01,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:01,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1452 of 1692 [2025-01-09 21:42:01,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:01,324 INFO L124 PetriNetUnfolderBase]: 0/958 cut-off events. [2025-01-09 21:42:01,324 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2025-01-09 21:42:01,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 958 events. 0/958 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 568 event pairs, 0 based on Foata normal form. 1/958 useless extension candidates. Maximal degree in co-relation 0. Up to 143 conditions per place. [2025-01-09 21:42:01,325 INFO L140 encePairwiseOnDemand]: 1687/1692 looper letters, 53 selfloop transitions, 2 changer transitions 3/368 dead transitions. [2025-01-09 21:42:01,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 368 transitions, 1122 flow [2025-01-09 21:42:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7319 transitions. [2025-01-09 21:42:01,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651300236406619 [2025-01-09 21:42:01,327 INFO L175 Difference]: Start difference. First operand has 483 places, 366 transitions, 1002 flow. Second operand 5 states and 7319 transitions. [2025-01-09 21:42:01,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 368 transitions, 1122 flow [2025-01-09 21:42:01,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 368 transitions, 1121 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:01,331 INFO L231 Difference]: Finished difference. Result has 463 places, 365 transitions, 1007 flow [2025-01-09 21:42:01,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1692, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1007, PETRI_PLACES=463, PETRI_TRANSITIONS=365} [2025-01-09 21:42:01,331 INFO L279 CegarLoopForPetriNet]: 489 programPoint places, -26 predicate places. [2025-01-09 21:42:01,331 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 365 transitions, 1007 flow [2025-01-09 21:42:01,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1463.0) internal successors, (7315), 5 states have internal predecessors, (7315), 0 states have call successors, (0), 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-01-09 21:42:01,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:01,332 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:01,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-01-09 21:42:01,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-01-09 21:42:01,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -648321110, now seen corresponding path program 1 times [2025-01-09 21:42:01,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:01,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-01-09 21:42:01,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:01,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:01,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 21:42:01,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 21:42:01,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:01,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:01,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:01,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 21:42:01,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 21:42:01,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:01,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:01,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:01,738 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-01-09 21:42:01,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-01-09 21:42:01,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-01-09 21:42:01,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2025-01-09 21:42:01,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:01,739 WARN L246 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:01,740 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2025-01-09 21:42:01,901 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:01,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1773 places, 1728 transitions, 7964 flow [2025-01-09 21:42:02,492 INFO L124 PetriNetUnfolderBase]: 190/2992 cut-off events. [2025-01-09 21:42:02,492 INFO L125 PetriNetUnfolderBase]: For 17250/17250 co-relation queries the response was YES. [2025-01-09 21:42:02,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 2992 events. 190/2992 cut-off events. For 17250/17250 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8686 event pairs, 0 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 4213. Up to 94 conditions per place. [2025-01-09 21:42:02,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 1773 places, 1728 transitions, 7964 flow [2025-01-09 21:42:02,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 498 places, 406 transitions, 3069 flow [2025-01-09 21:42:02,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:02,577 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:02,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-01-09 21:42:02,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:02,578 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:02,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:02,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:02,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:02,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:42:02,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1477608643, now seen corresponding path program 1 times [2025-01-09 21:42:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 21:42:02,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:02,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:02,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:02,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:02,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:02,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 21:42:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447620612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913222141] [2025-01-09 21:42:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:02,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:02,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:02,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1439 out of 1728 [2025-01-09 21:42:02,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 406 transitions, 3069 flow. Second operand has 3 states, 3 states have (on average 1440.3333333333333) internal successors, (4321), 3 states have internal predecessors, (4321), 0 states have call successors, (0), 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-01-09 21:42:02,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:02,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1439 of 1728 [2025-01-09 21:42:02,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:03,257 INFO L124 PetriNetUnfolderBase]: 95/2332 cut-off events. [2025-01-09 21:42:03,257 INFO L125 PetriNetUnfolderBase]: For 18378/18378 co-relation queries the response was YES. [2025-01-09 21:42:03,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3938 conditions, 2332 events. 95/2332 cut-off events. For 18378/18378 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6208 event pairs, 47 based on Foata normal form. 1/2140 useless extension candidates. Maximal degree in co-relation 3786. Up to 335 conditions per place. [2025-01-09 21:42:03,314 INFO L140 encePairwiseOnDemand]: 1723/1728 looper letters, 56 selfloop transitions, 2 changer transitions 1/403 dead transitions. [2025-01-09 21:42:03,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 403 transitions, 3179 flow [2025-01-09 21:42:03,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4378 transitions. [2025-01-09 21:42:03,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445216049382716 [2025-01-09 21:42:03,316 INFO L175 Difference]: Start difference. First operand has 498 places, 406 transitions, 3069 flow. Second operand 3 states and 4378 transitions. [2025-01-09 21:42:03,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 403 transitions, 3179 flow [2025-01-09 21:42:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 403 transitions, 1198 flow, removed 990 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:03,338 INFO L231 Difference]: Finished difference. Result has 498 places, 402 transitions, 1084 flow [2025-01-09 21:42:03,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1728, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=498, PETRI_TRANSITIONS=402} [2025-01-09 21:42:03,338 INFO L279 CegarLoopForPetriNet]: 498 programPoint places, 0 predicate places. [2025-01-09 21:42:03,338 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 402 transitions, 1084 flow [2025-01-09 21:42:03,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1440.3333333333333) internal successors, (4321), 3 states have internal predecessors, (4321), 0 states have call successors, (0), 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-01-09 21:42:03,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:03,339 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] [2025-01-09 21:42:03,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-01-09 21:42:03,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:42:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1683169463, now seen corresponding path program 1 times [2025-01-09 21:42:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689204249] [2025-01-09 21:42:03,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:03,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689204249] [2025-01-09 21:42:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689204249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137923029] [2025-01-09 21:42:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:03,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:03,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:03,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:03,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1345 out of 1728 [2025-01-09 21:42:03,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 402 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 1346.0) internal successors, (4038), 3 states have internal predecessors, (4038), 0 states have call successors, (0), 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-01-09 21:42:03,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:03,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1345 of 1728 [2025-01-09 21:42:03,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:03,948 INFO L124 PetriNetUnfolderBase]: 48/2093 cut-off events. [2025-01-09 21:42:03,948 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-01-09 21:42:03,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 2093 events. 48/2093 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4634 event pairs, 0 based on Foata normal form. 47/2045 useless extension candidates. Maximal degree in co-relation 2546. Up to 240 conditions per place. [2025-01-09 21:42:03,991 INFO L140 encePairwiseOnDemand]: 1722/1728 looper letters, 54 selfloop transitions, 1 changer transitions 24/397 dead transitions. [2025-01-09 21:42:03,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 397 transitions, 1188 flow [2025-01-09 21:42:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4097 transitions. [2025-01-09 21:42:03,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7903163580246914 [2025-01-09 21:42:03,992 INFO L175 Difference]: Start difference. First operand has 498 places, 402 transitions, 1084 flow. Second operand 3 states and 4097 transitions. [2025-01-09 21:42:03,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 397 transitions, 1188 flow [2025-01-09 21:42:03,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 397 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:03,996 INFO L231 Difference]: Finished difference. Result has 492 places, 373 transitions, 1022 flow [2025-01-09 21:42:03,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1728, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1022, PETRI_PLACES=492, PETRI_TRANSITIONS=373} [2025-01-09 21:42:03,996 INFO L279 CegarLoopForPetriNet]: 498 programPoint places, -6 predicate places. [2025-01-09 21:42:03,996 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 373 transitions, 1022 flow [2025-01-09 21:42:03,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1346.0) internal successors, (4038), 3 states have internal predecessors, (4038), 0 states have call successors, (0), 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-01-09 21:42:03,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:03,997 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:03,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2025-01-09 21:42:03,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:42:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash -649109657, now seen corresponding path program 1 times [2025-01-09 21:42:04,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448567584] [2025-01-09 21:42:04,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:04,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 21:42:04,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 21:42:04,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:04,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:04,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:04,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448567584] [2025-01-09 21:42:04,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448567584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:04,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:04,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197086812] [2025-01-09 21:42:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:04,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:04,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:04,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1483 out of 1728 [2025-01-09 21:42:04,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 373 transitions, 1022 flow. Second operand has 5 states, 5 states have (on average 1494.2) internal successors, (7471), 5 states have internal predecessors, (7471), 0 states have call successors, (0), 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-01-09 21:42:04,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:04,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1483 of 1728 [2025-01-09 21:42:04,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:04,483 INFO L124 PetriNetUnfolderBase]: 0/978 cut-off events. [2025-01-09 21:42:04,483 INFO L125 PetriNetUnfolderBase]: For 1171/1171 co-relation queries the response was YES. [2025-01-09 21:42:04,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 978 events. 0/978 cut-off events. For 1171/1171 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 580 event pairs, 0 based on Foata normal form. 1/978 useless extension candidates. Maximal degree in co-relation 0. Up to 146 conditions per place. [2025-01-09 21:42:04,484 INFO L140 encePairwiseOnDemand]: 1723/1728 looper letters, 54 selfloop transitions, 2 changer transitions 3/375 dead transitions. [2025-01-09 21:42:04,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 375 transitions, 1144 flow [2025-01-09 21:42:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7475 transitions. [2025-01-09 21:42:04,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651620370370371 [2025-01-09 21:42:04,486 INFO L175 Difference]: Start difference. First operand has 492 places, 373 transitions, 1022 flow. Second operand 5 states and 7475 transitions. [2025-01-09 21:42:04,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 375 transitions, 1144 flow [2025-01-09 21:42:04,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 375 transitions, 1143 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:04,489 INFO L231 Difference]: Finished difference. Result has 472 places, 372 transitions, 1027 flow [2025-01-09 21:42:04,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1728, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1027, PETRI_PLACES=472, PETRI_TRANSITIONS=372} [2025-01-09 21:42:04,490 INFO L279 CegarLoopForPetriNet]: 498 programPoint places, -26 predicate places. [2025-01-09 21:42:04,490 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 372 transitions, 1027 flow [2025-01-09 21:42:04,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1494.2) internal successors, (7471), 5 states have internal predecessors, (7471), 0 states have call successors, (0), 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-01-09 21:42:04,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:04,490 INFO L206 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-01-09 21:42:04,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2025-01-09 21:42:04,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1294325446, now seen corresponding path program 1 times [2025-01-09 21:42:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777005600] [2025-01-09 21:42:04,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:04,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 21:42:04,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 21:42:04,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:04,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:04,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:04,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 21:42:04,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 21:42:04,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:04,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:04,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:04,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 54 remaining) [2025-01-09 21:42:04,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-01-09 21:42:04,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-01-09 21:42:04,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-01-09 21:42:04,812 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-01-09 21:42:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-01-09 21:42:04,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:04,812 WARN L246 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:04,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2025-01-09 21:42:04,938 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:04,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1810 places, 1764 transitions, 8228 flow [2025-01-09 21:42:05,519 INFO L124 PetriNetUnfolderBase]: 194/3055 cut-off events. [2025-01-09 21:42:05,519 INFO L125 PetriNetUnfolderBase]: For 18377/18377 co-relation queries the response was YES. [2025-01-09 21:42:05,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4421 conditions, 3055 events. 194/3055 cut-off events. For 18377/18377 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8983 event pairs, 0 based on Foata normal form. 0/2713 useless extension candidates. Maximal degree in co-relation 4326. Up to 96 conditions per place. [2025-01-09 21:42:05,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 1810 places, 1764 transitions, 8228 flow [2025-01-09 21:42:05,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 507 places, 413 transitions, 3179 flow [2025-01-09 21:42:05,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:05,604 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:05,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-01-09 21:42:05,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:05,607 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:05,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:05,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:05,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:05,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 306833603, now seen corresponding path program 1 times [2025-01-09 21:42:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-01-09 21:42:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:05,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:05,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:05,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444907341] [2025-01-09 21:42:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444907341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092418584] [2025-01-09 21:42:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:05,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:05,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:05,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1469 out of 1764 [2025-01-09 21:42:05,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 413 transitions, 3179 flow. Second operand has 3 states, 3 states have (on average 1470.3333333333333) internal successors, (4411), 3 states have internal predecessors, (4411), 0 states have call successors, (0), 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-01-09 21:42:05,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:05,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1469 of 1764 [2025-01-09 21:42:05,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:06,336 INFO L124 PetriNetUnfolderBase]: 97/2381 cut-off events. [2025-01-09 21:42:06,337 INFO L125 PetriNetUnfolderBase]: For 19553/19553 co-relation queries the response was YES. [2025-01-09 21:42:06,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 2381 events. 97/2381 cut-off events. For 19553/19553 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6551 event pairs, 48 based on Foata normal form. 1/2185 useless extension candidates. Maximal degree in co-relation 3892. Up to 342 conditions per place. [2025-01-09 21:42:06,396 INFO L140 encePairwiseOnDemand]: 1759/1764 looper letters, 57 selfloop transitions, 2 changer transitions 1/410 dead transitions. [2025-01-09 21:42:06,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 410 transitions, 3291 flow [2025-01-09 21:42:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4469 transitions. [2025-01-09 21:42:06,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444822373393802 [2025-01-09 21:42:06,397 INFO L175 Difference]: Start difference. First operand has 507 places, 413 transitions, 3179 flow. Second operand 3 states and 4469 transitions. [2025-01-09 21:42:06,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 410 transitions, 3291 flow [2025-01-09 21:42:06,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 507 places, 410 transitions, 1220 flow, removed 1035 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:06,423 INFO L231 Difference]: Finished difference. Result has 507 places, 409 transitions, 1104 flow [2025-01-09 21:42:06,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1764, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1104, PETRI_PLACES=507, PETRI_TRANSITIONS=409} [2025-01-09 21:42:06,423 INFO L279 CegarLoopForPetriNet]: 507 programPoint places, 0 predicate places. [2025-01-09 21:42:06,423 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 409 transitions, 1104 flow [2025-01-09 21:42:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1470.3333333333333) internal successors, (4411), 3 states have internal predecessors, (4411), 0 states have call successors, (0), 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-01-09 21:42:06,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:06,424 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] [2025-01-09 21:42:06,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-01-09 21:42:06,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash -422650807, now seen corresponding path program 1 times [2025-01-09 21:42:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-01-09 21:42:06,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:06,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283721167] [2025-01-09 21:42:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283721167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98638792] [2025-01-09 21:42:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:06,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:06,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:06,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1373 out of 1764 [2025-01-09 21:42:06,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 409 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 1374.0) internal successors, (4122), 3 states have internal predecessors, (4122), 0 states have call successors, (0), 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-01-09 21:42:06,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:06,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1373 of 1764 [2025-01-09 21:42:06,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:07,014 INFO L124 PetriNetUnfolderBase]: 49/2137 cut-off events. [2025-01-09 21:42:07,015 INFO L125 PetriNetUnfolderBase]: For 1221/1221 co-relation queries the response was YES. [2025-01-09 21:42:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2137 events. 49/2137 cut-off events. For 1221/1221 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4829 event pairs, 0 based on Foata normal form. 48/2088 useless extension candidates. Maximal degree in co-relation 2600. Up to 245 conditions per place. [2025-01-09 21:42:07,063 INFO L140 encePairwiseOnDemand]: 1758/1764 looper letters, 55 selfloop transitions, 1 changer transitions 24/404 dead transitions. [2025-01-09 21:42:07,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 404 transitions, 1210 flow [2025-01-09 21:42:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4182 transitions. [2025-01-09 21:42:07,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7902494331065759 [2025-01-09 21:42:07,065 INFO L175 Difference]: Start difference. First operand has 507 places, 409 transitions, 1104 flow. Second operand 3 states and 4182 transitions. [2025-01-09 21:42:07,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 404 transitions, 1210 flow [2025-01-09 21:42:07,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 404 transitions, 1206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:07,068 INFO L231 Difference]: Finished difference. Result has 501 places, 380 transitions, 1042 flow [2025-01-09 21:42:07,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1764, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=501, PETRI_TRANSITIONS=380} [2025-01-09 21:42:07,069 INFO L279 CegarLoopForPetriNet]: 507 programPoint places, -6 predicate places. [2025-01-09 21:42:07,069 INFO L471 AbstractCegarLoop]: Abstraction has has 501 places, 380 transitions, 1042 flow [2025-01-09 21:42:07,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1374.0) internal successors, (4122), 3 states have internal predecessors, (4122), 0 states have call successors, (0), 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-01-09 21:42:07,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:07,069 INFO L206 CegarLoopForPetriNet]: trace histogram [48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2025-01-09 21:42:07,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:07,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1283895710, now seen corresponding path program 1 times [2025-01-09 21:42:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321989134] [2025-01-09 21:42:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:07,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-01-09 21:42:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-01-09 21:42:07,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321989134] [2025-01-09 21:42:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321989134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:07,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434297073] [2025-01-09 21:42:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:07,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:07,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:07,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:07,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1514 out of 1764 [2025-01-09 21:42:07,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 380 transitions, 1042 flow. Second operand has 5 states, 5 states have (on average 1525.4) internal successors, (7627), 5 states have internal predecessors, (7627), 0 states have call successors, (0), 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-01-09 21:42:07,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:07,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1514 of 1764 [2025-01-09 21:42:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:07,589 INFO L124 PetriNetUnfolderBase]: 0/998 cut-off events. [2025-01-09 21:42:07,589 INFO L125 PetriNetUnfolderBase]: For 1220/1220 co-relation queries the response was YES. [2025-01-09 21:42:07,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 998 events. 0/998 cut-off events. For 1220/1220 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 591 event pairs, 0 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 0. Up to 149 conditions per place. [2025-01-09 21:42:07,590 INFO L140 encePairwiseOnDemand]: 1759/1764 looper letters, 55 selfloop transitions, 2 changer transitions 3/382 dead transitions. [2025-01-09 21:42:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 382 transitions, 1166 flow [2025-01-09 21:42:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7631 transitions. [2025-01-09 21:42:07,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8651927437641723 [2025-01-09 21:42:07,592 INFO L175 Difference]: Start difference. First operand has 501 places, 380 transitions, 1042 flow. Second operand 5 states and 7631 transitions. [2025-01-09 21:42:07,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 382 transitions, 1166 flow [2025-01-09 21:42:07,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 382 transitions, 1165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:07,596 INFO L231 Difference]: Finished difference. Result has 481 places, 379 transitions, 1047 flow [2025-01-09 21:42:07,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1764, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1047, PETRI_PLACES=481, PETRI_TRANSITIONS=379} [2025-01-09 21:42:07,596 INFO L279 CegarLoopForPetriNet]: 507 programPoint places, -26 predicate places. [2025-01-09 21:42:07,597 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 379 transitions, 1047 flow [2025-01-09 21:42:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1525.4) internal successors, (7627), 5 states have internal predecessors, (7627), 0 states have call successors, (0), 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-01-09 21:42:07,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:07,597 INFO L206 CegarLoopForPetriNet]: trace histogram [48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:07,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-01-09 21:42:07,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-01-09 21:42:07,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1491640849, now seen corresponding path program 1 times [2025-01-09 21:42:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519730976] [2025-01-09 21:42:07,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:07,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 21:42:07,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 21:42:07,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:07,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:07,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:07,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-09 21:42:07,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-09 21:42:07,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:07,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:07,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:07,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2025-01-09 21:42:07,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2025-01-09 21:42:07,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2025-01-09 21:42:07,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2025-01-09 21:42:07,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2025-01-09 21:42:07,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2025-01-09 21:42:07,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2025-01-09 21:42:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2025-01-09 21:42:07,971 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:07,971 WARN L246 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:07,971 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2025-01-09 21:42:08,095 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:08,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1847 places, 1800 transitions, 8496 flow [2025-01-09 21:42:08,767 INFO L124 PetriNetUnfolderBase]: 198/3118 cut-off events. [2025-01-09 21:42:08,768 INFO L125 PetriNetUnfolderBase]: For 19552/19552 co-relation queries the response was YES. [2025-01-09 21:42:08,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 3118 events. 198/3118 cut-off events. For 19552/19552 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 8911 event pairs, 0 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 4440. Up to 98 conditions per place. [2025-01-09 21:42:08,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 1847 places, 1800 transitions, 8496 flow [2025-01-09 21:42:08,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 516 places, 420 transitions, 3291 flow [2025-01-09 21:42:08,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:08,855 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:08,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-01-09 21:42:08,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:08,856 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:08,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:08,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:08,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:08,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -98963261, now seen corresponding path program 1 times [2025-01-09 21:42:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-01-09 21:42:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:08,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:08,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:08,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:08,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-01-09 21:42:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504712402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:08,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326278118] [2025-01-09 21:42:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:08,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:08,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:08,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:09,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1499 out of 1800 [2025-01-09 21:42:09,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 420 transitions, 3291 flow. Second operand has 3 states, 3 states have (on average 1500.3333333333333) internal successors, (4501), 3 states have internal predecessors, (4501), 0 states have call successors, (0), 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-01-09 21:42:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1499 of 1800 [2025-01-09 21:42:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:09,578 INFO L124 PetriNetUnfolderBase]: 99/2430 cut-off events. [2025-01-09 21:42:09,578 INFO L125 PetriNetUnfolderBase]: For 20777/20777 co-relation queries the response was YES. [2025-01-09 21:42:09,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 2430 events. 99/2430 cut-off events. For 20777/20777 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6439 event pairs, 49 based on Foata normal form. 1/2230 useless extension candidates. Maximal degree in co-relation 3999. Up to 349 conditions per place. [2025-01-09 21:42:09,642 INFO L140 encePairwiseOnDemand]: 1795/1800 looper letters, 58 selfloop transitions, 2 changer transitions 1/417 dead transitions. [2025-01-09 21:42:09,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 417 transitions, 3405 flow [2025-01-09 21:42:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4560 transitions. [2025-01-09 21:42:09,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-01-09 21:42:09,643 INFO L175 Difference]: Start difference. First operand has 516 places, 420 transitions, 3291 flow. Second operand 3 states and 4560 transitions. [2025-01-09 21:42:09,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 417 transitions, 3405 flow [2025-01-09 21:42:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 417 transitions, 1242 flow, removed 1081 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:09,679 INFO L231 Difference]: Finished difference. Result has 516 places, 416 transitions, 1124 flow [2025-01-09 21:42:09,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1800, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=516, PETRI_TRANSITIONS=416} [2025-01-09 21:42:09,683 INFO L279 CegarLoopForPetriNet]: 516 programPoint places, 0 predicate places. [2025-01-09 21:42:09,683 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 416 transitions, 1124 flow [2025-01-09 21:42:09,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1500.3333333333333) internal successors, (4501), 3 states have internal predecessors, (4501), 0 states have call successors, (0), 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-01-09 21:42:09,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:09,683 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] [2025-01-09 21:42:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-01-09 21:42:09,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash -626497975, now seen corresponding path program 1 times [2025-01-09 21:42:09,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:09,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551567513] [2025-01-09 21:42:09,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:09,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:09,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551567513] [2025-01-09 21:42:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551567513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188839051] [2025-01-09 21:42:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:09,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:09,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1401 out of 1800 [2025-01-09 21:42:09,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 416 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 1402.0) internal successors, (4206), 3 states have internal predecessors, (4206), 0 states have call successors, (0), 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-01-09 21:42:09,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:09,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1401 of 1800 [2025-01-09 21:42:09,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:10,330 INFO L124 PetriNetUnfolderBase]: 50/2181 cut-off events. [2025-01-09 21:42:10,330 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2025-01-09 21:42:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 2181 events. 50/2181 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4834 event pairs, 0 based on Foata normal form. 49/2131 useless extension candidates. Maximal degree in co-relation 2654. Up to 250 conditions per place. [2025-01-09 21:42:10,377 INFO L140 encePairwiseOnDemand]: 1794/1800 looper letters, 56 selfloop transitions, 1 changer transitions 24/411 dead transitions. [2025-01-09 21:42:10,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 411 transitions, 1232 flow [2025-01-09 21:42:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4267 transitions. [2025-01-09 21:42:10,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7901851851851852 [2025-01-09 21:42:10,379 INFO L175 Difference]: Start difference. First operand has 516 places, 416 transitions, 1124 flow. Second operand 3 states and 4267 transitions. [2025-01-09 21:42:10,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 411 transitions, 1232 flow [2025-01-09 21:42:10,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 411 transitions, 1228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:10,383 INFO L231 Difference]: Finished difference. Result has 510 places, 387 transitions, 1062 flow [2025-01-09 21:42:10,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1800, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=510, PETRI_TRANSITIONS=387} [2025-01-09 21:42:10,384 INFO L279 CegarLoopForPetriNet]: 516 programPoint places, -6 predicate places. [2025-01-09 21:42:10,384 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 387 transitions, 1062 flow [2025-01-09 21:42:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1402.0) internal successors, (4206), 3 states have internal predecessors, (4206), 0 states have call successors, (0), 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-01-09 21:42:10,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:10,384 INFO L206 CegarLoopForPetriNet]: trace histogram [49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:10,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-01-09 21:42:10,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1452529976, now seen corresponding path program 1 times [2025-01-09 21:42:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-01-09 21:42:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:10,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-01-09 21:42:10,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-01-09 21:42:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-01-09 21:42:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863839597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697783008] [2025-01-09 21:42:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:10,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:10,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:10,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:10,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1545 out of 1800 [2025-01-09 21:42:10,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 387 transitions, 1062 flow. Second operand has 5 states, 5 states have (on average 1556.6) internal successors, (7783), 5 states have internal predecessors, (7783), 0 states have call successors, (0), 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-01-09 21:42:10,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:10,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1545 of 1800 [2025-01-09 21:42:10,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:10,983 INFO L124 PetriNetUnfolderBase]: 0/1018 cut-off events. [2025-01-09 21:42:10,983 INFO L125 PetriNetUnfolderBase]: For 1270/1270 co-relation queries the response was YES. [2025-01-09 21:42:10,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 1018 events. 0/1018 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 604 event pairs, 0 based on Foata normal form. 1/1018 useless extension candidates. Maximal degree in co-relation 0. Up to 152 conditions per place. [2025-01-09 21:42:10,984 INFO L140 encePairwiseOnDemand]: 1795/1800 looper letters, 56 selfloop transitions, 2 changer transitions 3/389 dead transitions. [2025-01-09 21:42:10,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 389 transitions, 1188 flow [2025-01-09 21:42:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7787 transitions. [2025-01-09 21:42:10,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652222222222222 [2025-01-09 21:42:10,986 INFO L175 Difference]: Start difference. First operand has 510 places, 387 transitions, 1062 flow. Second operand 5 states and 7787 transitions. [2025-01-09 21:42:10,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 389 transitions, 1188 flow [2025-01-09 21:42:10,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 389 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:10,990 INFO L231 Difference]: Finished difference. Result has 490 places, 386 transitions, 1067 flow [2025-01-09 21:42:10,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1800, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1067, PETRI_PLACES=490, PETRI_TRANSITIONS=386} [2025-01-09 21:42:10,990 INFO L279 CegarLoopForPetriNet]: 516 programPoint places, -26 predicate places. [2025-01-09 21:42:10,990 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 386 transitions, 1067 flow [2025-01-09 21:42:10,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1556.6) internal successors, (7783), 5 states have internal predecessors, (7783), 0 states have call successors, (0), 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-01-09 21:42:10,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:10,991 INFO L206 CegarLoopForPetriNet]: trace histogram [49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:10,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-01-09 21:42:10,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2025-01-09 21:42:10,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1255039185, now seen corresponding path program 1 times [2025-01-09 21:42:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327579884] [2025-01-09 21:42:10,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-01-09 21:42:11,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-01-09 21:42:11,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:11,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:11,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-01-09 21:42:11,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-01-09 21:42:11,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:11,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:11,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:11,347 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:11,347 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2025-01-09 21:42:11,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2025-01-09 21:42:11,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2025-01-09 21:42:11,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2025-01-09 21:42:11,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2025-01-09 21:42:11,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2025-01-09 21:42:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2025-01-09 21:42:11,349 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:11,349 WARN L246 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:11,349 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2025-01-09 21:42:11,487 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:11,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1884 places, 1836 transitions, 8768 flow [2025-01-09 21:42:12,116 INFO L124 PetriNetUnfolderBase]: 202/3181 cut-off events. [2025-01-09 21:42:12,116 INFO L125 PetriNetUnfolderBase]: For 20776/20776 co-relation queries the response was YES. [2025-01-09 21:42:12,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 3181 events. 202/3181 cut-off events. For 20776/20776 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9275 event pairs, 0 based on Foata normal form. 0/2825 useless extension candidates. Maximal degree in co-relation 4555. Up to 100 conditions per place. [2025-01-09 21:42:12,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 1884 places, 1836 transitions, 8768 flow [2025-01-09 21:42:12,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 525 places, 427 transitions, 3405 flow [2025-01-09 21:42:12,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:12,213 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:12,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-01-09 21:42:12,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:12,214 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:12,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:12,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:12,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:12,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:12,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 260218051, now seen corresponding path program 1 times [2025-01-09 21:42:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-01-09 21:42:12,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:12,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:12,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:12,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:12,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:12,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-01-09 21:42:12,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180181491] [2025-01-09 21:42:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180181491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:12,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527769618] [2025-01-09 21:42:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:12,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:12,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:12,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1529 out of 1836 [2025-01-09 21:42:12,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 427 transitions, 3405 flow. Second operand has 3 states, 3 states have (on average 1530.3333333333333) internal successors, (4591), 3 states have internal predecessors, (4591), 0 states have call successors, (0), 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-01-09 21:42:12,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:12,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1529 of 1836 [2025-01-09 21:42:12,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:12,984 INFO L124 PetriNetUnfolderBase]: 101/2479 cut-off events. [2025-01-09 21:42:12,984 INFO L125 PetriNetUnfolderBase]: For 22051/22051 co-relation queries the response was YES. [2025-01-09 21:42:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4262 conditions, 2479 events. 101/2479 cut-off events. For 22051/22051 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6564 event pairs, 50 based on Foata normal form. 1/2275 useless extension candidates. Maximal degree in co-relation 4107. Up to 356 conditions per place. [2025-01-09 21:42:13,053 INFO L140 encePairwiseOnDemand]: 1831/1836 looper letters, 59 selfloop transitions, 2 changer transitions 1/424 dead transitions. [2025-01-09 21:42:13,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 424 transitions, 3521 flow [2025-01-09 21:42:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4651 transitions. [2025-01-09 21:42:13,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84440813362382 [2025-01-09 21:42:13,054 INFO L175 Difference]: Start difference. First operand has 525 places, 427 transitions, 3405 flow. Second operand 3 states and 4651 transitions. [2025-01-09 21:42:13,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 424 transitions, 3521 flow [2025-01-09 21:42:13,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 424 transitions, 1264 flow, removed 1128 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:13,082 INFO L231 Difference]: Finished difference. Result has 525 places, 423 transitions, 1144 flow [2025-01-09 21:42:13,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1836, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1144, PETRI_PLACES=525, PETRI_TRANSITIONS=423} [2025-01-09 21:42:13,082 INFO L279 CegarLoopForPetriNet]: 525 programPoint places, 0 predicate places. [2025-01-09 21:42:13,082 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 423 transitions, 1144 flow [2025-01-09 21:42:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1530.3333333333333) internal successors, (4591), 3 states have internal predecessors, (4591), 0 states have call successors, (0), 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-01-09 21:42:13,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:13,083 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] [2025-01-09 21:42:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-01-09 21:42:13,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2000256329, now seen corresponding path program 1 times [2025-01-09 21:42:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-01-09 21:42:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:13,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:13,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:13,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-01-09 21:42:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94521337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747571342] [2025-01-09 21:42:13,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:13,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:13,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:13,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1429 out of 1836 [2025-01-09 21:42:13,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 423 transitions, 1144 flow. Second operand has 3 states, 3 states have (on average 1430.0) internal successors, (4290), 3 states have internal predecessors, (4290), 0 states have call successors, (0), 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-01-09 21:42:13,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:13,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1429 of 1836 [2025-01-09 21:42:13,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:13,822 INFO L124 PetriNetUnfolderBase]: 51/2225 cut-off events. [2025-01-09 21:42:13,822 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2025-01-09 21:42:13,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2225 events. 51/2225 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 4934 event pairs, 0 based on Foata normal form. 50/2174 useless extension candidates. Maximal degree in co-relation 2708. Up to 255 conditions per place. [2025-01-09 21:42:13,872 INFO L140 encePairwiseOnDemand]: 1830/1836 looper letters, 57 selfloop transitions, 1 changer transitions 24/418 dead transitions. [2025-01-09 21:42:13,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 418 transitions, 1254 flow [2025-01-09 21:42:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4352 transitions. [2025-01-09 21:42:13,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7901234567901234 [2025-01-09 21:42:13,874 INFO L175 Difference]: Start difference. First operand has 525 places, 423 transitions, 1144 flow. Second operand 3 states and 4352 transitions. [2025-01-09 21:42:13,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 418 transitions, 1254 flow [2025-01-09 21:42:13,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 418 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:13,878 INFO L231 Difference]: Finished difference. Result has 519 places, 394 transitions, 1082 flow [2025-01-09 21:42:13,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1836, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1082, PETRI_PLACES=519, PETRI_TRANSITIONS=394} [2025-01-09 21:42:13,878 INFO L279 CegarLoopForPetriNet]: 525 programPoint places, -6 predicate places. [2025-01-09 21:42:13,878 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 394 transitions, 1082 flow [2025-01-09 21:42:13,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1430.0) internal successors, (4290), 3 states have internal predecessors, (4290), 0 states have call successors, (0), 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-01-09 21:42:13,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:13,879 INFO L206 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:13,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2025-01-09 21:42:13,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -175794023, now seen corresponding path program 1 times [2025-01-09 21:42:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-01-09 21:42:13,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 21:42:13,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 21:42:13,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:13,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:14,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-01-09 21:42:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816176217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:14,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546357] [2025-01-09 21:42:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:14,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:14,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1576 out of 1836 [2025-01-09 21:42:14,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 394 transitions, 1082 flow. Second operand has 5 states, 5 states have (on average 1587.8) internal successors, (7939), 5 states have internal predecessors, (7939), 0 states have call successors, (0), 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-01-09 21:42:14,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:14,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1576 of 1836 [2025-01-09 21:42:14,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:14,438 INFO L124 PetriNetUnfolderBase]: 0/1038 cut-off events. [2025-01-09 21:42:14,438 INFO L125 PetriNetUnfolderBase]: For 1321/1321 co-relation queries the response was YES. [2025-01-09 21:42:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 1038 events. 0/1038 cut-off events. For 1321/1321 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 616 event pairs, 0 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 0. Up to 155 conditions per place. [2025-01-09 21:42:14,439 INFO L140 encePairwiseOnDemand]: 1831/1836 looper letters, 57 selfloop transitions, 2 changer transitions 3/396 dead transitions. [2025-01-09 21:42:14,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 396 transitions, 1210 flow [2025-01-09 21:42:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7943 transitions. [2025-01-09 21:42:14,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652505446623093 [2025-01-09 21:42:14,442 INFO L175 Difference]: Start difference. First operand has 519 places, 394 transitions, 1082 flow. Second operand 5 states and 7943 transitions. [2025-01-09 21:42:14,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 396 transitions, 1210 flow [2025-01-09 21:42:14,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 396 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:14,446 INFO L231 Difference]: Finished difference. Result has 499 places, 393 transitions, 1087 flow [2025-01-09 21:42:14,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1836, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1087, PETRI_PLACES=499, PETRI_TRANSITIONS=393} [2025-01-09 21:42:14,446 INFO L279 CegarLoopForPetriNet]: 525 programPoint places, -26 predicate places. [2025-01-09 21:42:14,446 INFO L471 AbstractCegarLoop]: Abstraction has has 499 places, 393 transitions, 1087 flow [2025-01-09 21:42:14,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1587.8) internal successors, (7939), 5 states have internal predecessors, (7939), 0 states have call successors, (0), 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-01-09 21:42:14,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:14,447 INFO L206 CegarLoopForPetriNet]: trace histogram [50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-01-09 21:42:14,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:42:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 786365844, now seen corresponding path program 1 times [2025-01-09 21:42:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754886961] [2025-01-09 21:42:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:14,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 21:42:14,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 21:42:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:14,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 21:42:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 21:42:14,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:14,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:14,830 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:14,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 57 remaining) [2025-01-09 21:42:14,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 57 remaining) [2025-01-09 21:42:14,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 57 remaining) [2025-01-09 21:42:14,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 57 remaining) [2025-01-09 21:42:14,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 57 remaining) [2025-01-09 21:42:14,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 57 remaining) [2025-01-09 21:42:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-01-09 21:42:14,833 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:14,834 WARN L246 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:14,834 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2025-01-09 21:42:14,963 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1921 places, 1872 transitions, 9044 flow [2025-01-09 21:42:15,712 INFO L124 PetriNetUnfolderBase]: 206/3244 cut-off events. [2025-01-09 21:42:15,712 INFO L125 PetriNetUnfolderBase]: For 22050/22050 co-relation queries the response was YES. [2025-01-09 21:42:15,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 3244 events. 206/3244 cut-off events. For 22050/22050 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9276 event pairs, 0 based on Foata normal form. 0/2881 useless extension candidates. Maximal degree in co-relation 4671. Up to 102 conditions per place. [2025-01-09 21:42:15,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 1921 places, 1872 transitions, 9044 flow [2025-01-09 21:42:15,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 534 places, 434 transitions, 3521 flow [2025-01-09 21:42:15,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:15,782 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:15,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-09 21:42:15,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:15,783 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:15,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:15,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:15,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:15,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:15,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1384377539, now seen corresponding path program 1 times [2025-01-09 21:42:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:15,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914736891] [2025-01-09 21:42:15,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:15,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914736891] [2025-01-09 21:42:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914736891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196647196] [2025-01-09 21:42:15,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:15,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:15,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:15,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1559 out of 1872 [2025-01-09 21:42:15,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 434 transitions, 3521 flow. Second operand has 3 states, 3 states have (on average 1560.3333333333333) internal successors, (4681), 3 states have internal predecessors, (4681), 0 states have call successors, (0), 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-01-09 21:42:15,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:15,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1559 of 1872 [2025-01-09 21:42:15,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:16,546 INFO L124 PetriNetUnfolderBase]: 103/2528 cut-off events. [2025-01-09 21:42:16,546 INFO L125 PetriNetUnfolderBase]: For 23376/23376 co-relation queries the response was YES. [2025-01-09 21:42:16,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4372 conditions, 2528 events. 103/2528 cut-off events. For 23376/23376 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 6982 event pairs, 51 based on Foata normal form. 1/2320 useless extension candidates. Maximal degree in co-relation 4216. Up to 363 conditions per place. [2025-01-09 21:42:16,619 INFO L140 encePairwiseOnDemand]: 1867/1872 looper letters, 60 selfloop transitions, 2 changer transitions 1/431 dead transitions. [2025-01-09 21:42:16,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 431 transitions, 3639 flow [2025-01-09 21:42:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4742 transitions. [2025-01-09 21:42:16,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8443732193732194 [2025-01-09 21:42:16,621 INFO L175 Difference]: Start difference. First operand has 534 places, 434 transitions, 3521 flow. Second operand 3 states and 4742 transitions. [2025-01-09 21:42:16,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 431 transitions, 3639 flow [2025-01-09 21:42:16,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 431 transitions, 1286 flow, removed 1176 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:16,647 INFO L231 Difference]: Finished difference. Result has 534 places, 430 transitions, 1164 flow [2025-01-09 21:42:16,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1872, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=534, PETRI_TRANSITIONS=430} [2025-01-09 21:42:16,647 INFO L279 CegarLoopForPetriNet]: 534 programPoint places, 0 predicate places. [2025-01-09 21:42:16,647 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 430 transitions, 1164 flow [2025-01-09 21:42:16,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1560.3333333333333) internal successors, (4681), 3 states have internal predecessors, (4681), 0 states have call successors, (0), 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-01-09 21:42:16,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:16,648 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] [2025-01-09 21:42:16,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-01-09 21:42:16,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:16,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1132322487, now seen corresponding path program 1 times [2025-01-09 21:42:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-01-09 21:42:16,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:16,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:16,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:16,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125919774] [2025-01-09 21:42:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125919774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052364276] [2025-01-09 21:42:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:16,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:16,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:16,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:16,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1457 out of 1872 [2025-01-09 21:42:16,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 430 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 1458.0) internal successors, (4374), 3 states have internal predecessors, (4374), 0 states have call successors, (0), 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-01-09 21:42:16,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:16,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1457 of 1872 [2025-01-09 21:42:16,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:17,303 INFO L124 PetriNetUnfolderBase]: 52/2269 cut-off events. [2025-01-09 21:42:17,303 INFO L125 PetriNetUnfolderBase]: For 1374/1374 co-relation queries the response was YES. [2025-01-09 21:42:17,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 2269 events. 52/2269 cut-off events. For 1374/1374 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 5135 event pairs, 0 based on Foata normal form. 51/2217 useless extension candidates. Maximal degree in co-relation 2762. Up to 260 conditions per place. [2025-01-09 21:42:17,358 INFO L140 encePairwiseOnDemand]: 1866/1872 looper letters, 58 selfloop transitions, 1 changer transitions 24/425 dead transitions. [2025-01-09 21:42:17,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 425 transitions, 1276 flow [2025-01-09 21:42:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4437 transitions. [2025-01-09 21:42:17,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900641025641025 [2025-01-09 21:42:17,360 INFO L175 Difference]: Start difference. First operand has 534 places, 430 transitions, 1164 flow. Second operand 3 states and 4437 transitions. [2025-01-09 21:42:17,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 425 transitions, 1276 flow [2025-01-09 21:42:17,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 425 transitions, 1272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:17,364 INFO L231 Difference]: Finished difference. Result has 528 places, 401 transitions, 1102 flow [2025-01-09 21:42:17,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1872, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=528, PETRI_TRANSITIONS=401} [2025-01-09 21:42:17,365 INFO L279 CegarLoopForPetriNet]: 534 programPoint places, -6 predicate places. [2025-01-09 21:42:17,365 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 401 transitions, 1102 flow [2025-01-09 21:42:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1458.0) internal successors, (4374), 3 states have internal predecessors, (4374), 0 states have call successors, (0), 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-01-09 21:42:17,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:17,365 INFO L206 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:17,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2025-01-09 21:42:17,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1013455915, now seen corresponding path program 1 times [2025-01-09 21:42:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199133680] [2025-01-09 21:42:17,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:17,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-01-09 21:42:17,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-01-09 21:42:17,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199133680] [2025-01-09 21:42:17,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199133680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:17,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:17,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038016934] [2025-01-09 21:42:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:17,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:17,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:17,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:17,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1607 out of 1872 [2025-01-09 21:42:17,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 401 transitions, 1102 flow. Second operand has 5 states, 5 states have (on average 1619.0) internal successors, (8095), 5 states have internal predecessors, (8095), 0 states have call successors, (0), 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-01-09 21:42:17,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:17,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1607 of 1872 [2025-01-09 21:42:17,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:18,037 INFO L124 PetriNetUnfolderBase]: 0/1058 cut-off events. [2025-01-09 21:42:18,037 INFO L125 PetriNetUnfolderBase]: For 1373/1373 co-relation queries the response was YES. [2025-01-09 21:42:18,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 1058 events. 0/1058 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 627 event pairs, 0 based on Foata normal form. 1/1058 useless extension candidates. Maximal degree in co-relation 0. Up to 158 conditions per place. [2025-01-09 21:42:18,038 INFO L140 encePairwiseOnDemand]: 1867/1872 looper letters, 58 selfloop transitions, 2 changer transitions 3/403 dead transitions. [2025-01-09 21:42:18,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 403 transitions, 1232 flow [2025-01-09 21:42:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8099 transitions. [2025-01-09 21:42:18,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8652777777777778 [2025-01-09 21:42:18,041 INFO L175 Difference]: Start difference. First operand has 528 places, 401 transitions, 1102 flow. Second operand 5 states and 8099 transitions. [2025-01-09 21:42:18,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 403 transitions, 1232 flow [2025-01-09 21:42:18,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 403 transitions, 1231 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:18,045 INFO L231 Difference]: Finished difference. Result has 508 places, 400 transitions, 1107 flow [2025-01-09 21:42:18,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1872, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1107, PETRI_PLACES=508, PETRI_TRANSITIONS=400} [2025-01-09 21:42:18,045 INFO L279 CegarLoopForPetriNet]: 534 programPoint places, -26 predicate places. [2025-01-09 21:42:18,045 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 400 transitions, 1107 flow [2025-01-09 21:42:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1619.0) internal successors, (8095), 5 states have internal predecessors, (8095), 0 states have call successors, (0), 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-01-09 21:42:18,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:18,046 INFO L206 CegarLoopForPetriNet]: trace histogram [51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:18,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-01-09 21:42:18,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-01-09 21:42:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1795795520, now seen corresponding path program 1 times [2025-01-09 21:42:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:18,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015992002] [2025-01-09 21:42:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:18,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 744 statements into 1 equivalence classes. [2025-01-09 21:42:18,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 744 of 744 statements. [2025-01-09 21:42:18,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:18,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:18,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 744 statements into 1 equivalence classes. [2025-01-09 21:42:18,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 744 of 744 statements. [2025-01-09 21:42:18,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:18,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:18,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:18,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 58 remaining) [2025-01-09 21:42:18,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2025-01-09 21:42:18,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2025-01-09 21:42:18,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2025-01-09 21:42:18,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:18,448 WARN L246 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:18,448 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2025-01-09 21:42:18,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:18,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1958 places, 1908 transitions, 9324 flow [2025-01-09 21:42:19,270 INFO L124 PetriNetUnfolderBase]: 210/3307 cut-off events. [2025-01-09 21:42:19,270 INFO L125 PetriNetUnfolderBase]: For 23375/23375 co-relation queries the response was YES. [2025-01-09 21:42:19,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 3307 events. 210/3307 cut-off events. For 23375/23375 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9596 event pairs, 0 based on Foata normal form. 0/2937 useless extension candidates. Maximal degree in co-relation 4788. Up to 104 conditions per place. [2025-01-09 21:42:19,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 1958 places, 1908 transitions, 9324 flow [2025-01-09 21:42:19,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 543 places, 441 transitions, 3639 flow [2025-01-09 21:42:19,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:19,376 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:19,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-09 21:42:19,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:19,377 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:19,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:19,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:19,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:19,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:19,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:19,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1021452093, now seen corresponding path program 1 times [2025-01-09 21:42:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-01-09 21:42:19,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:19,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-01-09 21:42:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58002513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:19,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821167350] [2025-01-09 21:42:19,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:19,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:19,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:19,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:19,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1589 out of 1908 [2025-01-09 21:42:19,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 441 transitions, 3639 flow. Second operand has 3 states, 3 states have (on average 1590.3333333333333) internal successors, (4771), 3 states have internal predecessors, (4771), 0 states have call successors, (0), 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-01-09 21:42:19,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:19,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1589 of 1908 [2025-01-09 21:42:19,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:20,304 INFO L124 PetriNetUnfolderBase]: 105/2577 cut-off events. [2025-01-09 21:42:20,304 INFO L125 PetriNetUnfolderBase]: For 24753/24753 co-relation queries the response was YES. [2025-01-09 21:42:20,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4483 conditions, 2577 events. 105/2577 cut-off events. For 24753/24753 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 6842 event pairs, 52 based on Foata normal form. 1/2365 useless extension candidates. Maximal degree in co-relation 4326. Up to 370 conditions per place. [2025-01-09 21:42:20,337 INFO L140 encePairwiseOnDemand]: 1903/1908 looper letters, 61 selfloop transitions, 2 changer transitions 1/438 dead transitions. [2025-01-09 21:42:20,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 438 transitions, 3759 flow [2025-01-09 21:42:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4833 transitions. [2025-01-09 21:42:20,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8443396226415094 [2025-01-09 21:42:20,339 INFO L175 Difference]: Start difference. First operand has 543 places, 441 transitions, 3639 flow. Second operand 3 states and 4833 transitions. [2025-01-09 21:42:20,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 438 transitions, 3759 flow [2025-01-09 21:42:20,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 438 transitions, 1308 flow, removed 1225 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:20,367 INFO L231 Difference]: Finished difference. Result has 543 places, 437 transitions, 1184 flow [2025-01-09 21:42:20,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1908, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=543, PETRI_TRANSITIONS=437} [2025-01-09 21:42:20,368 INFO L279 CegarLoopForPetriNet]: 543 programPoint places, 0 predicate places. [2025-01-09 21:42:20,368 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 437 transitions, 1184 flow [2025-01-09 21:42:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1590.3333333333333) internal successors, (4771), 3 states have internal predecessors, (4771), 0 states have call successors, (0), 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-01-09 21:42:20,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:20,368 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] [2025-01-09 21:42:20,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-01-09 21:42:20,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1434299831, now seen corresponding path program 1 times [2025-01-09 21:42:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-01-09 21:42:20,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:20,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:20,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:20,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:20,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-01-09 21:42:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514555879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-01-09 21:42:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:20,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:20,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:20,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1485 out of 1908 [2025-01-09 21:42:20,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 437 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 1486.0) internal successors, (4458), 3 states have internal predecessors, (4458), 0 states have call successors, (0), 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-01-09 21:42:20,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:20,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1485 of 1908 [2025-01-09 21:42:20,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:21,044 INFO L124 PetriNetUnfolderBase]: 53/2313 cut-off events. [2025-01-09 21:42:21,044 INFO L125 PetriNetUnfolderBase]: For 1427/1427 co-relation queries the response was YES. [2025-01-09 21:42:21,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 2313 events. 53/2313 cut-off events. For 1427/1427 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 5134 event pairs, 0 based on Foata normal form. 52/2260 useless extension candidates. Maximal degree in co-relation 2816. Up to 265 conditions per place. [2025-01-09 21:42:21,100 INFO L140 encePairwiseOnDemand]: 1902/1908 looper letters, 59 selfloop transitions, 1 changer transitions 24/432 dead transitions. [2025-01-09 21:42:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 432 transitions, 1298 flow [2025-01-09 21:42:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4522 transitions. [2025-01-09 21:42:21,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900069881201957 [2025-01-09 21:42:21,102 INFO L175 Difference]: Start difference. First operand has 543 places, 437 transitions, 1184 flow. Second operand 3 states and 4522 transitions. [2025-01-09 21:42:21,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 432 transitions, 1298 flow [2025-01-09 21:42:21,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 432 transitions, 1294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:42:21,106 INFO L231 Difference]: Finished difference. Result has 537 places, 408 transitions, 1122 flow [2025-01-09 21:42:21,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1908, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=537, PETRI_TRANSITIONS=408} [2025-01-09 21:42:21,106 INFO L279 CegarLoopForPetriNet]: 543 programPoint places, -6 predicate places. [2025-01-09 21:42:21,106 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 408 transitions, 1122 flow [2025-01-09 21:42:21,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1486.0) internal successors, (4458), 3 states have internal predecessors, (4458), 0 states have call successors, (0), 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-01-09 21:42:21,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:21,107 INFO L206 CegarLoopForPetriNet]: trace histogram [52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-01-09 21:42:21,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 318363772, now seen corresponding path program 1 times [2025-01-09 21:42:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-01-09 21:42:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-01-09 21:42:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-01-09 21:42:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-01-09 21:42:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:21,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:21,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:42:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563938507] [2025-01-09 21:42:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:21,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:42:21,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:21,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:42:21,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:42:21,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1638 out of 1908 [2025-01-09 21:42:21,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 408 transitions, 1122 flow. Second operand has 5 states, 5 states have (on average 1650.2) internal successors, (8251), 5 states have internal predecessors, (8251), 0 states have call successors, (0), 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-01-09 21:42:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1638 of 1908 [2025-01-09 21:42:21,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:21,685 INFO L124 PetriNetUnfolderBase]: 0/1078 cut-off events. [2025-01-09 21:42:21,685 INFO L125 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2025-01-09 21:42:21,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 1078 events. 0/1078 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 640 event pairs, 0 based on Foata normal form. 1/1078 useless extension candidates. Maximal degree in co-relation 0. Up to 161 conditions per place. [2025-01-09 21:42:21,686 INFO L140 encePairwiseOnDemand]: 1903/1908 looper letters, 59 selfloop transitions, 2 changer transitions 3/410 dead transitions. [2025-01-09 21:42:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 410 transitions, 1254 flow [2025-01-09 21:42:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:42:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:42:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8255 transitions. [2025-01-09 21:42:21,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653039832285115 [2025-01-09 21:42:21,688 INFO L175 Difference]: Start difference. First operand has 537 places, 408 transitions, 1122 flow. Second operand 5 states and 8255 transitions. [2025-01-09 21:42:21,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 410 transitions, 1254 flow [2025-01-09 21:42:21,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 410 transitions, 1253 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:21,693 INFO L231 Difference]: Finished difference. Result has 517 places, 407 transitions, 1127 flow [2025-01-09 21:42:21,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1908, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1127, PETRI_PLACES=517, PETRI_TRANSITIONS=407} [2025-01-09 21:42:21,693 INFO L279 CegarLoopForPetriNet]: 543 programPoint places, -26 predicate places. [2025-01-09 21:42:21,693 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 407 transitions, 1127 flow [2025-01-09 21:42:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1650.2) internal successors, (8251), 5 states have internal predecessors, (8251), 0 states have call successors, (0), 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-01-09 21:42:21,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:21,694 INFO L206 CegarLoopForPetriNet]: trace histogram [52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:42:21,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-01-09 21:42:21,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:42:21,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1842765261, now seen corresponding path program 1 times [2025-01-09 21:42:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-01-09 21:42:21,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:21,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-01-09 21:42:21,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-01-09 21:42:21,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:21,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:21,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:42:21,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 758 statements into 1 equivalence classes. [2025-01-09 21:42:21,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 758 of 758 statements. [2025-01-09 21:42:21,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:21,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:42:22,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:42:22,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 59 remaining) [2025-01-09 21:42:22,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2025-01-09 21:42:22,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (28 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (27 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (26 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (25 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2025-01-09 21:42:22,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2025-01-09 21:42:22,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2025-01-09 21:42:22,115 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:42:22,116 WARN L246 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:42:22,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2025-01-09 21:42:22,253 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:42:22,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1995 places, 1944 transitions, 9608 flow [2025-01-09 21:42:23,354 INFO L124 PetriNetUnfolderBase]: 214/3370 cut-off events. [2025-01-09 21:42:23,354 INFO L125 PetriNetUnfolderBase]: For 24752/24752 co-relation queries the response was YES. [2025-01-09 21:42:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 3370 events. 214/3370 cut-off events. For 24752/24752 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 9942 event pairs, 0 based on Foata normal form. 0/2993 useless extension candidates. Maximal degree in co-relation 4906. Up to 106 conditions per place. [2025-01-09 21:42:23,450 INFO L82 GeneralOperation]: Start removeDead. Operand has 1995 places, 1944 transitions, 9608 flow [2025-01-09 21:42:23,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 552 places, 448 transitions, 3759 flow [2025-01-09 21:42:23,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:42:23,457 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;@574916dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:42:23,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-09 21:42:23,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:42:23,458 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:42:23,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:42:23,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:23,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:42:23,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:23,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1632663747, now seen corresponding path program 1 times [2025-01-09 21:42:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134291215] [2025-01-09 21:42:23,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:42:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:42:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134291215] [2025-01-09 21:42:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134291215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6250364] [2025-01-09 21:42:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:23,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:23,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:23,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1619 out of 1944 [2025-01-09 21:42:23,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 448 transitions, 3759 flow. Second operand has 3 states, 3 states have (on average 1620.3333333333333) internal successors, (4861), 3 states have internal predecessors, (4861), 0 states have call successors, (0), 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-01-09 21:42:23,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:23,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1619 of 1944 [2025-01-09 21:42:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:42:24,302 INFO L124 PetriNetUnfolderBase]: 107/2626 cut-off events. [2025-01-09 21:42:24,302 INFO L125 PetriNetUnfolderBase]: For 26183/26183 co-relation queries the response was YES. [2025-01-09 21:42:24,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4595 conditions, 2626 events. 107/2626 cut-off events. For 26183/26183 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 7275 event pairs, 53 based on Foata normal form. 1/2410 useless extension candidates. Maximal degree in co-relation 4437. Up to 377 conditions per place. [2025-01-09 21:42:24,381 INFO L140 encePairwiseOnDemand]: 1939/1944 looper letters, 62 selfloop transitions, 2 changer transitions 1/445 dead transitions. [2025-01-09 21:42:24,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 445 transitions, 3881 flow [2025-01-09 21:42:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:42:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:42:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4924 transitions. [2025-01-09 21:42:24,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8443072702331962 [2025-01-09 21:42:24,383 INFO L175 Difference]: Start difference. First operand has 552 places, 448 transitions, 3759 flow. Second operand 3 states and 4924 transitions. [2025-01-09 21:42:24,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 445 transitions, 3881 flow [2025-01-09 21:42:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 445 transitions, 1330 flow, removed 1275 selfloop flow, removed 1 redundant places. [2025-01-09 21:42:24,415 INFO L231 Difference]: Finished difference. Result has 552 places, 444 transitions, 1204 flow [2025-01-09 21:42:24,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1944, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1204, PETRI_PLACES=552, PETRI_TRANSITIONS=444} [2025-01-09 21:42:24,416 INFO L279 CegarLoopForPetriNet]: 552 programPoint places, 0 predicate places. [2025-01-09 21:42:24,416 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 444 transitions, 1204 flow [2025-01-09 21:42:24,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1620.3333333333333) internal successors, (4861), 3 states have internal predecessors, (4861), 0 states have call successors, (0), 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-01-09 21:42:24,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:42:24,417 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] [2025-01-09 21:42:24,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-01-09 21:42:24,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-01-09 21:42:24,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:42:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1094324297, now seen corresponding path program 1 times [2025-01-09 21:42:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:42:24,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-01-09 21:42:24,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:42:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:42:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:42:24,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:42:24,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:42:24,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:42:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:42:24,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:42:24,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986934271] [2025-01-09 21:42:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986934271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:42:24,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:42:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:42:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884978924] [2025-01-09 21:42:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:42:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:42:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:42:24,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:42:24,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:42:24,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1513 out of 1944 [2025-01-09 21:42:24,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 444 transitions, 1204 flow. Second operand has 3 states, 3 states have (on average 1514.0) internal successors, (4542), 3 states have internal predecessors, (4542), 0 states have call successors, (0), 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-01-09 21:42:24,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:42:24,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1513 of 1944 [2025-01-09 21:42:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand