./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:58:00,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:58:00,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:58:00,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:58:00,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:58:00,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:58:00,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:58:00,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:58:00,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:58:00,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:58:00,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:58:00,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:58:00,325 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:58:00,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:58:00,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:58:00,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:58:00,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:58:00,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:58:00,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:58:00,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:58:00,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:58:00,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:58:00,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:58:00,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:00,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:58:00,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:58:00,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:58:00,330 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-02-06 08:58:00,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:58:00,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:58:00,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:58:00,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:58:00,653 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:58:00,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-06 08:58:02,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/829d80d30/73568469a7c8435fbf761bed82db9005/FLAG2b7f7014d [2025-02-06 08:58:02,432 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:58:02,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-06 08:58:02,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/829d80d30/73568469a7c8435fbf761bed82db9005/FLAG2b7f7014d [2025-02-06 08:58:02,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/829d80d30/73568469a7c8435fbf761bed82db9005 [2025-02-06 08:58:02,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:58:02,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:58:02,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:02,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:58:02,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:58:02,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:02" (1/1) ... [2025-02-06 08:58:02,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c1208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:02, skipping insertion in model container [2025-02-06 08:58:02,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:58:02" (1/1) ... [2025-02-06 08:58:02,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:58:03,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:03,033 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:58:03,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:58:03,119 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:58:03,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03 WrapperNode [2025-02-06 08:58:03,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:58:03,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:03,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:58:03,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:58:03,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,177 INFO L138 Inliner]: procedures = 170, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-02-06 08:58:03,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:58:03,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:58:03,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:58:03,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:58:03,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:58:03,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:58:03,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:58:03,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:58:03,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (1/1) ... [2025-02-06 08:58:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:58:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:58:03,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:58:03,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 08:58:03,269 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 08:58:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:58:03,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:58:03,270 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:58:03,383 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:58:03,385 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:58:03,657 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-02-06 08:58:03,658 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-02-06 08:58:03,694 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:58:03,694 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:58:03,944 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:58:03,946 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:58:03,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:03 BoogieIcfgContainer [2025-02-06 08:58:03,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:58:03,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:58:03,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:58:03,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:58:03,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:58:02" (1/3) ... [2025-02-06 08:58:03,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e1cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:03, skipping insertion in model container [2025-02-06 08:58:03,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:58:03" (2/3) ... [2025-02-06 08:58:03,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e1cac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:58:03, skipping insertion in model container [2025-02-06 08:58:03,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:58:03" (3/3) ... [2025-02-06 08:58:03,958 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-02-06 08:58:03,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:58:03,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 56 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-02-06 08:58:03,976 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:58:04,088 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:04,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 122 flow [2025-02-06 08:58:04,165 INFO L124 PetriNetUnfolderBase]: 3/66 cut-off events. [2025-02-06 08:58:04,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:04,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-06 08:58:04,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 59 transitions, 122 flow [2025-02-06 08:58:04,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 59 transitions, 122 flow [2025-02-06 08:58:04,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:04,210 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;@54dd7c26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:04,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 08:58:04,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:04,225 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-06 08:58:04,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:58:04,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:04,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:04,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 08:58:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1945853787, now seen corresponding path program 1 times [2025-02-06 08:58:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444366661] [2025-02-06 08:58:04,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:04,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:04,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:04,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:04,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444366661] [2025-02-06 08:58:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444366661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:58:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189004718] [2025-02-06 08:58:04,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:04,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:58:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:04,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:58:04,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:58:04,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 59 [2025-02-06 08:58:04,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 122 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:04,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:04,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 59 [2025-02-06 08:58:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:04,849 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-02-06 08:58:04,849 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:04,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 51 events. 2/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 6/54 useless extension candidates. Maximal degree in co-relation 37. Up to 5 conditions per place. [2025-02-06 08:58:04,852 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 4 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-02-06 08:58:04,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 108 flow [2025-02-06 08:58:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:58:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:58:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2025-02-06 08:58:04,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8983050847457628 [2025-02-06 08:58:04,867 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 122 flow. Second operand 2 states and 106 transitions. [2025-02-06 08:58:04,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 108 flow [2025-02-06 08:58:04,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:04,873 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 100 flow [2025-02-06 08:58:04,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-02-06 08:58:04,880 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2025-02-06 08:58:04,880 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 100 flow [2025-02-06 08:58:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:04,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:04,881 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:04,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:58:04,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 08:58:04,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1484219642, now seen corresponding path program 1 times [2025-02-06 08:58:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863849027] [2025-02-06 08:58:04,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:04,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:04,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:04,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:04,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:04,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:04,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:04,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:04,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:04,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:04,944 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-06 08:58:04,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-06 08:58:04,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-06 08:58:04,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-06 08:58:04,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-06 08:58:04,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-06 08:58:04,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-06 08:58:04,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:58:04,947 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 08:58:04,950 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:04,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 08:58:05,020 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 202 flow [2025-02-06 08:58:05,082 INFO L124 PetriNetUnfolderBase]: 6/112 cut-off events. [2025-02-06 08:58:05,082 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:58:05,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 112 events. 6/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 320 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2025-02-06 08:58:05,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 202 flow [2025-02-06 08:58:05,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 202 flow [2025-02-06 08:58:05,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:05,088 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;@54dd7c26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:05,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-06 08:58:05,099 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:05,099 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-06 08:58:05,099 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:05,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:05,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:05,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:58:05,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 289531391, now seen corresponding path program 1 times [2025-02-06 08:58:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-02-06 08:58:05,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:05,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:05,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:05,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:05,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-02-06 08:58:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647554741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:05,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:05,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:58:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500213188] [2025-02-06 08:58:05,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:05,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:58:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:05,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:58:05,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:58:05,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 96 [2025-02-06 08:58:05,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:05,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:05,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 96 [2025-02-06 08:58:05,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:05,419 INFO L124 PetriNetUnfolderBase]: 24/202 cut-off events. [2025-02-06 08:58:05,419 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 08:58:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 202 events. 24/202 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 693 event pairs, 12 based on Foata normal form. 34/217 useless extension candidates. Maximal degree in co-relation 180. Up to 37 conditions per place. [2025-02-06 08:58:05,422 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 8 selfloop transitions, 0 changer transitions 0/78 dead transitions. [2025-02-06 08:58:05,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 182 flow [2025-02-06 08:58:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:58:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:58:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 169 transitions. [2025-02-06 08:58:05,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802083333333334 [2025-02-06 08:58:05,425 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 202 flow. Second operand 2 states and 169 transitions. [2025-02-06 08:58:05,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 182 flow [2025-02-06 08:58:05,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 78 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:05,427 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 166 flow [2025-02-06 08:58:05,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2025-02-06 08:58:05,430 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -15 predicate places. [2025-02-06 08:58:05,430 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 166 flow [2025-02-06 08:58:05,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:05,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:05,430 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:58:05,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-06 08:58:05,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -451482709, now seen corresponding path program 1 times [2025-02-06 08:58:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982389084] [2025-02-06 08:58:05,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:05,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 08:58:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 08:58:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:05,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:05,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 08:58:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 08:58:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:05,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:05,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:05,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:05,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-06 08:58:05,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-06 08:58:05,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-06 08:58:05,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-06 08:58:05,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-06 08:58:05,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-06 08:58:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-06 08:58:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-06 08:58:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-06 08:58:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-06 08:58:05,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-06 08:58:05,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-06 08:58:05,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-06 08:58:05,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-06 08:58:05,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:58:05,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 08:58:05,471 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:05,471 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 08:58:05,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 133 transitions, 284 flow [2025-02-06 08:58:05,617 INFO L124 PetriNetUnfolderBase]: 9/158 cut-off events. [2025-02-06 08:58:05,618 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 08:58:05,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 158 events. 9/158 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 526 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 117. Up to 4 conditions per place. [2025-02-06 08:58:05,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 133 transitions, 284 flow [2025-02-06 08:58:05,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 133 transitions, 284 flow [2025-02-06 08:58:05,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:05,626 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;@54dd7c26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:05,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-06 08:58:05,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:05,632 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-02-06 08:58:05,632 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:05,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:05,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:05,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 08:58:05,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -180758013, now seen corresponding path program 1 times [2025-02-06 08:58:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-02-06 08:58:05,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:05,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:05,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:05,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:05,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254482493] [2025-02-06 08:58:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254482493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:58:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470078688] [2025-02-06 08:58:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:58:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:05,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:58:05,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:58:05,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 133 [2025-02-06 08:58:05,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 133 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:05,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:05,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 133 [2025-02-06 08:58:05,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:06,117 INFO L124 PetriNetUnfolderBase]: 174/865 cut-off events. [2025-02-06 08:58:06,117 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-02-06 08:58:06,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 865 events. 174/865 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5606 event pairs, 108 based on Foata normal form. 174/947 useless extension candidates. Maximal degree in co-relation 833. Up to 229 conditions per place. [2025-02-06 08:58:06,131 INFO L140 encePairwiseOnDemand]: 111/133 looper letters, 12 selfloop transitions, 0 changer transitions 0/108 dead transitions. [2025-02-06 08:58:06,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 258 flow [2025-02-06 08:58:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:58:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:58:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 232 transitions. [2025-02-06 08:58:06,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721804511278195 [2025-02-06 08:58:06,136 INFO L175 Difference]: Start difference. First operand has 131 places, 133 transitions, 284 flow. Second operand 2 states and 232 transitions. [2025-02-06 08:58:06,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 258 flow [2025-02-06 08:58:06,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 256 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:06,139 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 232 flow [2025-02-06 08:58:06,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=232, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-02-06 08:58:06,141 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -21 predicate places. [2025-02-06 08:58:06,141 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 232 flow [2025-02-06 08:58:06,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:06,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:06,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:06,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:58:06,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 08:58:06,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1872257309, now seen corresponding path program 1 times [2025-02-06 08:58:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129284304] [2025-02-06 08:58:06,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:06,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 08:58:06,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 08:58:06,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:06,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:06,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:06,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129284304] [2025-02-06 08:58:06,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129284304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:06,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:06,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958545134] [2025-02-06 08:58:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:06,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:06,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:06,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:06,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 133 [2025-02-06 08:58:06,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:06,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:06,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 133 [2025-02-06 08:58:06,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:08,503 INFO L124 PetriNetUnfolderBase]: 805/2765 cut-off events. [2025-02-06 08:58:08,504 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2025-02-06 08:58:08,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 2765 events. 805/2765 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 24363 event pairs, 235 based on Foata normal form. 0/2463 useless extension candidates. Maximal degree in co-relation 4133. Up to 770 conditions per place. [2025-02-06 08:58:08,535 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 46 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2025-02-06 08:58:08,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 149 transitions, 478 flow [2025-02-06 08:58:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions. [2025-02-06 08:58:08,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7556390977443609 [2025-02-06 08:58:08,539 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 232 flow. Second operand 6 states and 603 transitions. [2025-02-06 08:58:08,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 149 transitions, 478 flow [2025-02-06 08:58:08,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 149 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:08,544 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 346 flow [2025-02-06 08:58:08,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2025-02-06 08:58:08,544 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -11 predicate places. [2025-02-06 08:58:08,545 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 346 flow [2025-02-06 08:58:08,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:08,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:08,545 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:08,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:58:08,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 08:58:08,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash -780387643, now seen corresponding path program 1 times [2025-02-06 08:58:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082064840] [2025-02-06 08:58:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:08,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 08:58:08,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 08:58:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:08,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 08:58:08,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 08:58:08,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:08,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:08,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:08,580 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:08,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-06 08:58:08,581 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-06 08:58:08,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-06 08:58:08,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-06 08:58:08,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-06 08:58:08,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-06 08:58:08,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:58:08,584 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 08:58:08,585 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:08,585 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 08:58:08,669 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:08,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 170 transitions, 368 flow [2025-02-06 08:58:08,702 INFO L124 PetriNetUnfolderBase]: 12/204 cut-off events. [2025-02-06 08:58:08,702 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 08:58:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 204 events. 12/204 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 740 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 166. Up to 5 conditions per place. [2025-02-06 08:58:08,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 170 transitions, 368 flow [2025-02-06 08:58:08,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 170 transitions, 368 flow [2025-02-06 08:58:08,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:08,708 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;@54dd7c26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:08,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-06 08:58:08,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:08,711 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-06 08:58:08,711 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:08,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:08,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:08,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-06 08:58:08,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1629972889, now seen corresponding path program 1 times [2025-02-06 08:58:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664526021] [2025-02-06 08:58:08,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:08,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:08,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:08,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664526021] [2025-02-06 08:58:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664526021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:58:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284792749] [2025-02-06 08:58:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:08,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:58:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:08,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:58:08,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:58:08,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 170 [2025-02-06 08:58:08,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 170 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:08,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:08,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 170 [2025-02-06 08:58:08,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:09,505 INFO L124 PetriNetUnfolderBase]: 1028/3768 cut-off events. [2025-02-06 08:58:09,506 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-02-06 08:58:09,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 3768 events. 1028/3768 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 33621 event pairs, 684 based on Foata normal form. 854/4224 useless extension candidates. Maximal degree in co-relation 3814. Up to 1253 conditions per place. [2025-02-06 08:58:09,553 INFO L140 encePairwiseOnDemand]: 141/170 looper letters, 16 selfloop transitions, 0 changer transitions 0/138 dead transitions. [2025-02-06 08:58:09,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 336 flow [2025-02-06 08:58:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:58:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:58:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2025-02-06 08:58:09,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2025-02-06 08:58:09,555 INFO L175 Difference]: Start difference. First operand has 167 places, 170 transitions, 368 flow. Second operand 2 states and 295 transitions. [2025-02-06 08:58:09,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 336 flow [2025-02-06 08:58:09,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 330 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:09,559 INFO L231 Difference]: Finished difference. Result has 140 places, 138 transitions, 298 flow [2025-02-06 08:58:09,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=298, PETRI_PLACES=140, PETRI_TRANSITIONS=138} [2025-02-06 08:58:09,562 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -27 predicate places. [2025-02-06 08:58:09,562 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 138 transitions, 298 flow [2025-02-06 08:58:09,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:09,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:09,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:09,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:58:09,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-06 08:58:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash 387034317, now seen corresponding path program 1 times [2025-02-06 08:58:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396575795] [2025-02-06 08:58:09,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:09,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:09,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 08:58:09,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 08:58:09,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:09,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396575795] [2025-02-06 08:58:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396575795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799218439] [2025-02-06 08:58:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:09,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:09,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:09,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:10,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 170 [2025-02-06 08:58:10,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 138 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:10,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:10,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 170 [2025-02-06 08:58:10,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:14,020 INFO L124 PetriNetUnfolderBase]: 4956/13700 cut-off events. [2025-02-06 08:58:14,020 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2025-02-06 08:58:14,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21098 conditions, 13700 events. 4956/13700 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 146811 event pairs, 1678 based on Foata normal form. 0/12245 useless extension candidates. Maximal degree in co-relation 21091. Up to 4383 conditions per place. [2025-02-06 08:58:14,171 INFO L140 encePairwiseOnDemand]: 158/170 looper letters, 62 selfloop transitions, 20 changer transitions 0/195 dead transitions. [2025-02-06 08:58:14,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 195 transitions, 636 flow [2025-02-06 08:58:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2025-02-06 08:58:14,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7637254901960784 [2025-02-06 08:58:14,178 INFO L175 Difference]: Start difference. First operand has 140 places, 138 transitions, 298 flow. Second operand 6 states and 779 transitions. [2025-02-06 08:58:14,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 195 transitions, 636 flow [2025-02-06 08:58:14,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:14,184 INFO L231 Difference]: Finished difference. Result has 150 places, 157 transitions, 438 flow [2025-02-06 08:58:14,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=150, PETRI_TRANSITIONS=157} [2025-02-06 08:58:14,186 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -17 predicate places. [2025-02-06 08:58:14,187 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 157 transitions, 438 flow [2025-02-06 08:58:14,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:14,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:14,188 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 08:58:14,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:58:14,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-06 08:58:14,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash 351286592, now seen corresponding path program 1 times [2025-02-06 08:58:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006796182] [2025-02-06 08:58:14,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:14,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 08:58:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 08:58:14,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006796182] [2025-02-06 08:58:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006796182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765071284] [2025-02-06 08:58:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:14,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:14,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 170 [2025-02-06 08:58:14,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 157 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:14,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:14,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 170 [2025-02-06 08:58:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:19,623 INFO L124 PetriNetUnfolderBase]: 13762/36257 cut-off events. [2025-02-06 08:58:19,623 INFO L125 PetriNetUnfolderBase]: For 11504/12371 co-relation queries the response was YES. [2025-02-06 08:58:19,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64350 conditions, 36257 events. 13762/36257 cut-off events. For 11504/12371 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 446402 event pairs, 3667 based on Foata normal form. 0/32555 useless extension candidates. Maximal degree in co-relation 64338. Up to 12115 conditions per place. [2025-02-06 08:58:20,102 INFO L140 encePairwiseOnDemand]: 158/170 looper letters, 71 selfloop transitions, 60 changer transitions 0/250 dead transitions. [2025-02-06 08:58:20,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 250 transitions, 1112 flow [2025-02-06 08:58:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2025-02-06 08:58:20,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7598039215686274 [2025-02-06 08:58:20,106 INFO L175 Difference]: Start difference. First operand has 150 places, 157 transitions, 438 flow. Second operand 6 states and 775 transitions. [2025-02-06 08:58:20,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 250 transitions, 1112 flow [2025-02-06 08:58:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 250 transitions, 1112 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:20,131 INFO L231 Difference]: Finished difference. Result has 160 places, 216 transitions, 1030 flow [2025-02-06 08:58:20,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1030, PETRI_PLACES=160, PETRI_TRANSITIONS=216} [2025-02-06 08:58:20,132 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places. [2025-02-06 08:58:20,132 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 216 transitions, 1030 flow [2025-02-06 08:58:20,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:20,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:20,133 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:20,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:58:20,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-06 08:58:20,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1366751704, now seen corresponding path program 1 times [2025-02-06 08:58:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747022285] [2025-02-06 08:58:20,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:20,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 08:58:20,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 08:58:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:20,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:58:20,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 08:58:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 08:58:20,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:20,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:58:20,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:58:20,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-02-06 08:58:20,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-02-06 08:58:20,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-02-06 08:58:20,165 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-02-06 08:58:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-02-06 08:58:20,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:58:20,167 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 08:58:20,167 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:58:20,167 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 08:58:20,289 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:58:20,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 207 transitions, 454 flow [2025-02-06 08:58:20,334 INFO L124 PetriNetUnfolderBase]: 15/250 cut-off events. [2025-02-06 08:58:20,335 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 08:58:20,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 250 events. 15/250 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 943 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 217. Up to 6 conditions per place. [2025-02-06 08:58:20,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 207 transitions, 454 flow [2025-02-06 08:58:20,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 207 transitions, 454 flow [2025-02-06 08:58:20,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:58:20,346 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;@54dd7c26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:58:20,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-02-06 08:58:20,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:58:20,348 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-02-06 08:58:20,348 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:58:20,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:20,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:20,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 08:58:20,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1336808107, now seen corresponding path program 1 times [2025-02-06 08:58:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:20,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-02-06 08:58:20,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:20,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:58:20,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:58:20,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:20,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:20,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251497964] [2025-02-06 08:58:20,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251497964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:20,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:20,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:58:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080931115] [2025-02-06 08:58:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:58:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:20,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:58:20,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:58:20,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 207 [2025-02-06 08:58:20,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 207 transitions, 454 flow. Second operand has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:20,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:20,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 207 [2025-02-06 08:58:20,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:22,414 INFO L124 PetriNetUnfolderBase]: 5466/16399 cut-off events. [2025-02-06 08:58:22,414 INFO L125 PetriNetUnfolderBase]: For 4599/4599 co-relation queries the response was YES. [2025-02-06 08:58:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24712 conditions, 16399 events. 5466/16399 cut-off events. For 4599/4599 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 178428 event pairs, 3756 based on Foata normal form. 4074/18832 useless extension candidates. Maximal degree in co-relation 17259. Up to 6373 conditions per place. [2025-02-06 08:58:22,637 INFO L140 encePairwiseOnDemand]: 171/207 looper letters, 20 selfloop transitions, 0 changer transitions 0/168 dead transitions. [2025-02-06 08:58:22,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 168 transitions, 416 flow [2025-02-06 08:58:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:58:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:58:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 358 transitions. [2025-02-06 08:58:22,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8647342995169082 [2025-02-06 08:58:22,639 INFO L175 Difference]: Start difference. First operand has 203 places, 207 transitions, 454 flow. Second operand 2 states and 358 transitions. [2025-02-06 08:58:22,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 168 transitions, 416 flow [2025-02-06 08:58:22,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 404 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:22,642 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 364 flow [2025-02-06 08:58:22,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=364, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-02-06 08:58:22,643 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, -33 predicate places. [2025-02-06 08:58:22,643 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 364 flow [2025-02-06 08:58:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:22,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:22,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:58:22,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:58:22,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 08:58:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -325507020, now seen corresponding path program 1 times [2025-02-06 08:58:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5381958] [2025-02-06 08:58:22,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:22,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 08:58:22,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 08:58:22,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:22,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:58:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5381958] [2025-02-06 08:58:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5381958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:22,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664773420] [2025-02-06 08:58:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:22,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:22,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:22,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:23,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 207 [2025-02-06 08:58:23,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:23,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:23,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 207 [2025-02-06 08:58:23,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:58:31,777 INFO L124 PetriNetUnfolderBase]: 26524/62788 cut-off events. [2025-02-06 08:58:31,777 INFO L125 PetriNetUnfolderBase]: For 4772/4772 co-relation queries the response was YES. [2025-02-06 08:58:32,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99307 conditions, 62788 events. 26524/62788 cut-off events. For 4772/4772 co-relation queries the response was YES. Maximal size of possible extension queue 2144. Compared 756447 event pairs, 9749 based on Foata normal form. 0/56547 useless extension candidates. Maximal degree in co-relation 99299. Up to 22453 conditions per place. [2025-02-06 08:58:32,857 INFO L140 encePairwiseOnDemand]: 194/207 looper letters, 78 selfloop transitions, 24 changer transitions 0/241 dead transitions. [2025-02-06 08:58:32,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 241 transitions, 794 flow [2025-02-06 08:58:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:58:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:58:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2025-02-06 08:58:32,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7689210950080515 [2025-02-06 08:58:32,861 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 364 flow. Second operand 6 states and 955 transitions. [2025-02-06 08:58:32,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 241 transitions, 794 flow [2025-02-06 08:58:32,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 241 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:58:32,869 INFO L231 Difference]: Finished difference. Result has 180 places, 191 transitions, 530 flow [2025-02-06 08:58:32,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=180, PETRI_TRANSITIONS=191} [2025-02-06 08:58:32,870 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, -23 predicate places. [2025-02-06 08:58:32,870 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 191 transitions, 530 flow [2025-02-06 08:58:32,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:32,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:58:32,872 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 08:58:32,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:58:32,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-02-06 08:58:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:58:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1163195419, now seen corresponding path program 1 times [2025-02-06 08:58:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:58:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736853241] [2025-02-06 08:58:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:58:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:58:32,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 08:58:32,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 08:58:32,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:58:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:58:33,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-02-06 08:58:33,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:58:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736853241] [2025-02-06 08:58:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736853241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:58:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:58:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:58:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252444554] [2025-02-06 08:58:33,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:58:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:58:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:58:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:58:33,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:58:33,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 207 [2025-02-06 08:58:33,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 191 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:58:33,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:58:33,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 207 [2025-02-06 08:58:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand