./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/goblint-regression/28-race_reach_01-simple_racing.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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:33:42,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:33:42,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:33:42,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:33:42,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:33:42,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:33:42,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:33:42,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:33:42,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:33:42,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:33:42,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:33:42,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:33:42,116 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:33:42,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:33:42,117 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:33:42,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:42,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:33:42,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:33:42,118 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-02-08 05:33:42,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:33:42,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:33:42,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:33:42,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:33:42,340 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:33:42,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-02-08 05:33:43,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62bccac41/4707dd934c5142c7b2b5ac26874e2fd5/FLAGfefcf95b1 [2025-02-08 05:33:43,740 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:33:43,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-02-08 05:33:43,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62bccac41/4707dd934c5142c7b2b5ac26874e2fd5/FLAGfefcf95b1 [2025-02-08 05:33:43,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62bccac41/4707dd934c5142c7b2b5ac26874e2fd5 [2025-02-08 05:33:43,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:33:43,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:33:43,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:43,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:33:43,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:33:43,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:43" (1/1) ... [2025-02-08 05:33:43,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e35fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:43, skipping insertion in model container [2025-02-08 05:33:43,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:33:43" (1/1) ... [2025-02-08 05:33:43,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:33:44,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:44,064 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:33:44,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:33:44,126 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:33:44,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44 WrapperNode [2025-02-08 05:33:44,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:33:44,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:44,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:33:44,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:33:44,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,164 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-02-08 05:33:44,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:33:44,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:33:44,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:33:44,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:33:44,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:33:44,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:33:44,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:33:44,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:33:44,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (1/1) ... [2025-02-08 05:33:44,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:33:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:44,224 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-08 05:33:44,227 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-08 05:33:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:33:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:33:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:33:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:33:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:33:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:33:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:33:44,244 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:33:44,333 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:33:44,334 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:33:44,483 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:33:44,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:33:44,526 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:33:44,526 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:33:44,550 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:33:44,550 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:33:44,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:44 BoogieIcfgContainer [2025-02-08 05:33:44,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:33:44,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:33:44,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:33:44,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:33:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:33:43" (1/3) ... [2025-02-08 05:33:44,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5802c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:44, skipping insertion in model container [2025-02-08 05:33:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:33:44" (2/3) ... [2025-02-08 05:33:44,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5802c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:33:44, skipping insertion in model container [2025-02-08 05:33:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:33:44" (3/3) ... [2025-02-08 05:33:44,558 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-02-08 05:33:44,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:33:44,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 137 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-08 05:33:44,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:33:44,623 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:33:44,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 148 transitions, 303 flow [2025-02-08 05:33:44,716 INFO L124 PetriNetUnfolderBase]: 15/206 cut-off events. [2025-02-08 05:33:44,718 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:33:44,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 206 events. 15/206 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 648 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2025-02-08 05:33:44,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 148 transitions, 303 flow [2025-02-08 05:33:44,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 148 transitions, 303 flow [2025-02-08 05:33:44,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:44,744 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;@23dc699d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:44,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 05:33:44,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:44,755 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:33:44,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:44,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:44,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:44,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:44,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash 943946393, now seen corresponding path program 1 times [2025-02-08 05:33:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-08 05:33:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:44,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:33:44,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:33:44,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:45,000 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-08 05:33:45,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-08 05:33:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071892848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:45,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:45,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:45,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699541633] [2025-02-08 05:33:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:45,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 148 [2025-02-08 05:33:45,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 148 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-08 05:33:45,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:45,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 148 [2025-02-08 05:33:45,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:45,188 INFO L124 PetriNetUnfolderBase]: 48/509 cut-off events. [2025-02-08 05:33:45,188 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:33:45,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 509 events. 48/509 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2346 event pairs, 35 based on Foata normal form. 81/537 useless extension candidates. Maximal degree in co-relation 553. Up to 108 conditions per place. [2025-02-08 05:33:45,192 INFO L140 encePairwiseOnDemand]: 135/148 looper letters, 22 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 05:33:45,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 339 flow [2025-02-08 05:33:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2025-02-08 05:33:45,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963963963963963 [2025-02-08 05:33:45,206 INFO L175 Difference]: Start difference. First operand has 140 places, 148 transitions, 303 flow. Second operand 3 states and 398 transitions. [2025-02-08 05:33:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 339 flow [2025-02-08 05:33:45,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:45,215 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 287 flow [2025-02-08 05:33:45,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2025-02-08 05:33:45,219 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 1 predicate places. [2025-02-08 05:33:45,220 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 287 flow [2025-02-08 05:33:45,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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-08 05:33:45,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:45,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:45,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:33:45,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:45,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash -89687310, now seen corresponding path program 1 times [2025-02-08 05:33:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806027808] [2025-02-08 05:33:45,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:45,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:33:45,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:33:45,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:45,663 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-08 05:33:45,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806027808] [2025-02-08 05:33:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806027808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:45,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871039661] [2025-02-08 05:33:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:45,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:45,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:45,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:45,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 148 [2025-02-08 05:33:45,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 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-08 05:33:45,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:45,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 148 [2025-02-08 05:33:45,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:45,907 INFO L124 PetriNetUnfolderBase]: 108/784 cut-off events. [2025-02-08 05:33:45,907 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:33:45,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 784 events. 108/784 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4465 event pairs, 66 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 971. Up to 181 conditions per place. [2025-02-08 05:33:45,914 INFO L140 encePairwiseOnDemand]: 142/148 looper letters, 48 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-02-08 05:33:45,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 159 transitions, 439 flow [2025-02-08 05:33:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2025-02-08 05:33:45,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-02-08 05:33:45,918 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 287 flow. Second operand 6 states and 696 transitions. [2025-02-08 05:33:45,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 159 transitions, 439 flow [2025-02-08 05:33:45,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 159 transitions, 435 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:45,921 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 291 flow [2025-02-08 05:33:45,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2025-02-08 05:33:45,922 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2025-02-08 05:33:45,922 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 291 flow [2025-02-08 05:33:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 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-08 05:33:45,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:45,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:45,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:33:45,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:45,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1129468234, now seen corresponding path program 1 times [2025-02-08 05:33:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 05:33:45,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:33:45,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:33:45,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:45,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:45,977 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-08 05:33:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 05:33:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976291745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121036760] [2025-02-08 05:33:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:45,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:45,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:45,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 148 [2025-02-08 05:33:45,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-08 05:33:45,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:45,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 148 [2025-02-08 05:33:45,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:46,094 INFO L124 PetriNetUnfolderBase]: 91/806 cut-off events. [2025-02-08 05:33:46,094 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:33:46,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 806 events. 91/806 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4760 event pairs, 30 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 973. Up to 125 conditions per place. [2025-02-08 05:33:46,097 INFO L140 encePairwiseOnDemand]: 139/148 looper letters, 30 selfloop transitions, 6 changer transitions 0/148 dead transitions. [2025-02-08 05:33:46,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 148 transitions, 392 flow [2025-02-08 05:33:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2025-02-08 05:33:46,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8581081081081081 [2025-02-08 05:33:46,098 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 291 flow. Second operand 3 states and 381 transitions. [2025-02-08 05:33:46,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 148 transitions, 392 flow [2025-02-08 05:33:46,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 148 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:46,100 INFO L231 Difference]: Finished difference. Result has 140 places, 137 transitions, 319 flow [2025-02-08 05:33:46,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=140, PETRI_TRANSITIONS=137} [2025-02-08 05:33:46,101 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2025-02-08 05:33:46,101 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 137 transitions, 319 flow [2025-02-08 05:33:46,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-08 05:33:46,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:46,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:46,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:33:46,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-08 05:33:46,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1052498276, now seen corresponding path program 1 times [2025-02-08 05:33:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27969165] [2025-02-08 05:33:46,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:46,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:33:46,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:33:46,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:46,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:33:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:33:46,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:33:46,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:46,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:46,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:33:46,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:33:46,168 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-08 05:33:46,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-08 05:33:46,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-08 05:33:46,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-08 05:33:46,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-08 05:33:46,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-08 05:33:46,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-08 05:33:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:33:46,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:33:46,175 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:33:46,175 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:33:46,195 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:33:46,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 199 transitions, 414 flow [2025-02-08 05:33:46,228 INFO L124 PetriNetUnfolderBase]: 27/342 cut-off events. [2025-02-08 05:33:46,229 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:33:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 342 events. 27/342 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1228 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 208. Up to 6 conditions per place. [2025-02-08 05:33:46,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 199 transitions, 414 flow [2025-02-08 05:33:46,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 199 transitions, 414 flow [2025-02-08 05:33:46,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:46,235 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;@23dc699d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:46,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:33:46,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:46,239 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:33:46,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:46,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:46,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:46,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1910131168, now seen corresponding path program 1 times [2025-02-08 05:33:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-02-08 05:33:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:46,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:33:46,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:33:46,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:46,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348194247] [2025-02-08 05:33:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348194247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093419979] [2025-02-08 05:33:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:46,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 199 [2025-02-08 05:33:46,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 199 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-08 05:33:46,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:46,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 199 [2025-02-08 05:33:46,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:46,748 INFO L124 PetriNetUnfolderBase]: 788/4494 cut-off events. [2025-02-08 05:33:46,748 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 05:33:46,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 4494 events. 788/4494 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 42699 event pairs, 703 based on Foata normal form. 1023/5084 useless extension candidates. Maximal degree in co-relation 4409. Up to 1303 conditions per place. [2025-02-08 05:33:46,769 INFO L140 encePairwiseOnDemand]: 180/199 looper letters, 31 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-02-08 05:33:46,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 188 transitions, 458 flow [2025-02-08 05:33:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-02-08 05:33:46,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8777219430485762 [2025-02-08 05:33:46,771 INFO L175 Difference]: Start difference. First operand has 186 places, 199 transitions, 414 flow. Second operand 3 states and 524 transitions. [2025-02-08 05:33:46,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 188 transitions, 458 flow [2025-02-08 05:33:46,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 188 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:46,776 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 390 flow [2025-02-08 05:33:46,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2025-02-08 05:33:46,777 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 1 predicate places. [2025-02-08 05:33:46,777 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 390 flow [2025-02-08 05:33:46,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-08 05:33:46,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:46,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:46,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:33:46,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash -202730158, now seen corresponding path program 1 times [2025-02-08 05:33:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-02-08 05:33:46,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:33:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:33:46,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:46,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:46,991 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-08 05:33:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072159083] [2025-02-08 05:33:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072159083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930512783] [2025-02-08 05:33:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:46,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:46,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:47,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 199 [2025-02-08 05:33:47,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-08 05:33:47,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:47,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 199 [2025-02-08 05:33:47,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:47,797 INFO L124 PetriNetUnfolderBase]: 1723/7198 cut-off events. [2025-02-08 05:33:47,798 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-02-08 05:33:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10178 conditions, 7198 events. 1723/7198 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 72935 event pairs, 760 based on Foata normal form. 0/6449 useless extension candidates. Maximal degree in co-relation 5579. Up to 2025 conditions per place. [2025-02-08 05:33:47,832 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 80 selfloop transitions, 6 changer transitions 0/229 dead transitions. [2025-02-08 05:33:47,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 229 transitions, 656 flow [2025-02-08 05:33:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 950 transitions. [2025-02-08 05:33:47,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7956448911222781 [2025-02-08 05:33:47,835 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 390 flow. Second operand 6 states and 950 transitions. [2025-02-08 05:33:47,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 229 transitions, 656 flow [2025-02-08 05:33:47,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 229 transitions, 654 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:33:47,838 INFO L231 Difference]: Finished difference. Result has 190 places, 181 transitions, 398 flow [2025-02-08 05:33:47,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=190, PETRI_TRANSITIONS=181} [2025-02-08 05:33:47,839 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 4 predicate places. [2025-02-08 05:33:47,839 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 181 transitions, 398 flow [2025-02-08 05:33:47,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-08 05:33:47,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:47,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:47,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:33:47,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:47,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash -83892487, now seen corresponding path program 1 times [2025-02-08 05:33:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:47,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-02-08 05:33:47,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:47,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:33:47,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:33:47,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:47,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:47,873 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-08 05:33:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-02-08 05:33:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984270987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764308177] [2025-02-08 05:33:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:47,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2025-02-08 05:33:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 181 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-08 05:33:47,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:47,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2025-02-08 05:33:47,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:49,117 INFO L124 PetriNetUnfolderBase]: 3895/14730 cut-off events. [2025-02-08 05:33:49,117 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-08 05:33:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21288 conditions, 14730 events. 3895/14730 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 165356 event pairs, 1409 based on Foata normal form. 0/13198 useless extension candidates. Maximal degree in co-relation 14719. Up to 3516 conditions per place. [2025-02-08 05:33:49,194 INFO L140 encePairwiseOnDemand]: 180/199 looper letters, 58 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2025-02-08 05:33:49,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 214 transitions, 619 flow [2025-02-08 05:33:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-08 05:33:49,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847571189279732 [2025-02-08 05:33:49,196 INFO L175 Difference]: Start difference. First operand has 190 places, 181 transitions, 398 flow. Second operand 3 states and 506 transitions. [2025-02-08 05:33:49,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 214 transitions, 619 flow [2025-02-08 05:33:49,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 214 transitions, 607 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:49,200 INFO L231 Difference]: Finished difference. Result has 189 places, 195 transitions, 508 flow [2025-02-08 05:33:49,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=189, PETRI_TRANSITIONS=195} [2025-02-08 05:33:49,200 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 3 predicate places. [2025-02-08 05:33:49,200 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 195 transitions, 508 flow [2025-02-08 05:33:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-08 05:33:49,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:49,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:49,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:33:49,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1308560188, now seen corresponding path program 1 times [2025-02-08 05:33:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:49,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-02-08 05:33:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:33:49,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:33:49,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:49,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:49,233 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-08 05:33:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-02-08 05:33:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625505099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:33:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244962656] [2025-02-08 05:33:49,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:49,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:49,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:49,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2025-02-08 05:33:49,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 195 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-08 05:33:49,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:49,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2025-02-08 05:33:49,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:50,451 INFO L124 PetriNetUnfolderBase]: 4045/16767 cut-off events. [2025-02-08 05:33:50,451 INFO L125 PetriNetUnfolderBase]: For 4377/4554 co-relation queries the response was YES. [2025-02-08 05:33:50,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27522 conditions, 16767 events. 4045/16767 cut-off events. For 4377/4554 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 198572 event pairs, 2517 based on Foata normal form. 46/15265 useless extension candidates. Maximal degree in co-relation 26225. Up to 5540 conditions per place. [2025-02-08 05:33:50,514 INFO L140 encePairwiseOnDemand]: 190/199 looper letters, 52 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2025-02-08 05:33:50,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 219 transitions, 726 flow [2025-02-08 05:33:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2025-02-08 05:33:50,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8375209380234506 [2025-02-08 05:33:50,515 INFO L175 Difference]: Start difference. First operand has 189 places, 195 transitions, 508 flow. Second operand 3 states and 500 transitions. [2025-02-08 05:33:50,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 219 transitions, 726 flow [2025-02-08 05:33:50,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 219 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:50,525 INFO L231 Difference]: Finished difference. Result has 191 places, 207 transitions, 606 flow [2025-02-08 05:33:50,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=191, PETRI_TRANSITIONS=207} [2025-02-08 05:33:50,526 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 5 predicate places. [2025-02-08 05:33:50,526 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 207 transitions, 606 flow [2025-02-08 05:33:50,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-08 05:33:50,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:50,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:50,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:33:50,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash 706516061, now seen corresponding path program 1 times [2025-02-08 05:33:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-02-08 05:33:50,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:50,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:33:50,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:33:50,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:50,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:50,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-02-08 05:33:50,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488859146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:50,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:50,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:50,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029497643] [2025-02-08 05:33:50,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:50,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:33:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:50,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:33:50,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:33:50,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2025-02-08 05:33:50,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 207 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 156.4) internal successors, (782), 5 states have internal predecessors, (782), 0 states have call successors, (0), 0 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-08 05:33:50,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:50,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2025-02-08 05:33:50,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:52,334 INFO L124 PetriNetUnfolderBase]: 3045/17654 cut-off events. [2025-02-08 05:33:52,335 INFO L125 PetriNetUnfolderBase]: For 1347/2304 co-relation queries the response was YES. [2025-02-08 05:33:52,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25038 conditions, 17654 events. 3045/17654 cut-off events. For 1347/2304 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 229726 event pairs, 605 based on Foata normal form. 14/15760 useless extension candidates. Maximal degree in co-relation 11344. Up to 3794 conditions per place. [2025-02-08 05:33:52,405 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 56 selfloop transitions, 5 changer transitions 0/239 dead transitions. [2025-02-08 05:33:52,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 239 transitions, 792 flow [2025-02-08 05:33:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 986 transitions. [2025-02-08 05:33:52,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8257956448911222 [2025-02-08 05:33:52,408 INFO L175 Difference]: Start difference. First operand has 191 places, 207 transitions, 606 flow. Second operand 6 states and 986 transitions. [2025-02-08 05:33:52,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 239 transitions, 792 flow [2025-02-08 05:33:52,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 239 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:52,416 INFO L231 Difference]: Finished difference. Result has 197 places, 209 transitions, 604 flow [2025-02-08 05:33:52,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=197, PETRI_TRANSITIONS=209} [2025-02-08 05:33:52,418 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, 11 predicate places. [2025-02-08 05:33:52,419 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 209 transitions, 604 flow [2025-02-08 05:33:52,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.4) internal successors, (782), 5 states have internal predecessors, (782), 0 states have call successors, (0), 0 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-08 05:33:52,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:52,420 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:52,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:33:52,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:33:52,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -96287486, now seen corresponding path program 1 times [2025-02-08 05:33:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881911690] [2025-02-08 05:33:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:52,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:33:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:33:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:52,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:33:52,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:33:52,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:33:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:33:52,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:33:52,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:33:52,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 05:33:52,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-02-08 05:33:52,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-02-08 05:33:52,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-02-08 05:33:52,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-02-08 05:33:52,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-02-08 05:33:52,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:33:52,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:33:52,473 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:33:52,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:33:52,506 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:33:52,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 250 transitions, 527 flow [2025-02-08 05:33:52,538 INFO L124 PetriNetUnfolderBase]: 42/521 cut-off events. [2025-02-08 05:33:52,538 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:33:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 521 events. 42/521 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2052 event pairs, 1 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 350. Up to 12 conditions per place. [2025-02-08 05:33:52,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 250 transitions, 527 flow [2025-02-08 05:33:52,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 250 transitions, 527 flow [2025-02-08 05:33:52,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:33:52,546 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23dc699d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:33:52,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:33:52,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:33:52,548 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-02-08 05:33:52,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:33:52,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:52,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:52,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:33:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash 80763354, now seen corresponding path program 1 times [2025-02-08 05:33:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-02-08 05:33:52,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:33:52,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:33:52,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:52,574 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-08 05:33:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-02-08 05:33:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139130057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:33:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38001881] [2025-02-08 05:33:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:33:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:52,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:33:52,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:33:52,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 250 [2025-02-08 05:33:52,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 250 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:52,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:52,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 250 [2025-02-08 05:33:52,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:55,686 INFO L124 PetriNetUnfolderBase]: 8949/36673 cut-off events. [2025-02-08 05:33:55,686 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2025-02-08 05:33:55,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49918 conditions, 36673 events. 8949/36673 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 480001 event pairs, 8324 based on Foata normal form. 10573/43815 useless extension candidates. Maximal degree in co-relation 36484. Up to 12808 conditions per place. [2025-02-08 05:33:55,898 INFO L140 encePairwiseOnDemand]: 225/250 looper letters, 39 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-02-08 05:33:55,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 233 transitions, 575 flow [2025-02-08 05:33:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:33:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:33:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2025-02-08 05:33:55,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653333333333333 [2025-02-08 05:33:55,900 INFO L175 Difference]: Start difference. First operand has 232 places, 250 transitions, 527 flow. Second operand 3 states and 649 transitions. [2025-02-08 05:33:55,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 233 transitions, 575 flow [2025-02-08 05:33:55,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:55,904 INFO L231 Difference]: Finished difference. Result has 233 places, 227 transitions, 491 flow [2025-02-08 05:33:55,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=233, PETRI_TRANSITIONS=227} [2025-02-08 05:33:55,905 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 1 predicate places. [2025-02-08 05:33:55,905 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 227 transitions, 491 flow [2025-02-08 05:33:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:55,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:55,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:33:55,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:33:55,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1078557294, now seen corresponding path program 1 times [2025-02-08 05:33:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-02-08 05:33:55,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:33:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:33:55,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:55,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263028662] [2025-02-08 05:33:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263028662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118995245] [2025-02-08 05:33:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:56,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:56,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 250 [2025-02-08 05:33:56,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 227 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-08 05:33:56,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:56,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 250 [2025-02-08 05:33:56,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:00,750 INFO L124 PetriNetUnfolderBase]: 19555/51562 cut-off events. [2025-02-08 05:34:00,750 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2025-02-08 05:34:00,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80722 conditions, 51562 events. 19555/51562 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 625242 event pairs, 2086 based on Foata normal form. 0/48140 useless extension candidates. Maximal degree in co-relation 75951. Up to 20048 conditions per place. [2025-02-08 05:34:01,057 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 112 selfloop transitions, 6 changer transitions 0/298 dead transitions. [2025-02-08 05:34:01,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 298 transitions, 869 flow [2025-02-08 05:34:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:34:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:34:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1204 transitions. [2025-02-08 05:34:01,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8026666666666666 [2025-02-08 05:34:01,060 INFO L175 Difference]: Start difference. First operand has 233 places, 227 transitions, 491 flow. Second operand 6 states and 1204 transitions. [2025-02-08 05:34:01,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 298 transitions, 869 flow [2025-02-08 05:34:01,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 298 transitions, 867 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:34:01,064 INFO L231 Difference]: Finished difference. Result has 236 places, 226 transitions, 499 flow [2025-02-08 05:34:01,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=236, PETRI_TRANSITIONS=226} [2025-02-08 05:34:01,065 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, 4 predicate places. [2025-02-08 05:34:01,065 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 226 transitions, 499 flow [2025-02-08 05:34:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-08 05:34:01,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:01,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:34:01,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-02-08 05:34:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -917636662, now seen corresponding path program 1 times [2025-02-08 05:34:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:01,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213765866] [2025-02-08 05:34:01,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:34:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:01,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:34:01,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:34:01,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:34:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:01,092 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-08 05:34:01,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:01,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213765866] [2025-02-08 05:34:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213765866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:34:01,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:34:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:34:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899994026] [2025-02-08 05:34:01,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:34:01,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:34:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:01,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:34:01,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:34:01,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 250 [2025-02-08 05:34:01,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 226 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-08 05:34:01,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:01,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 250 [2025-02-08 05:34:01,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:25,021 INFO L124 PetriNetUnfolderBase]: 108065/278423 cut-off events. [2025-02-08 05:34:25,021 INFO L125 PetriNetUnfolderBase]: For 6276/6276 co-relation queries the response was YES. [2025-02-08 05:34:25,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434423 conditions, 278423 events. 108065/278423 cut-off events. For 6276/6276 co-relation queries the response was YES. Maximal size of possible extension queue 5729. Compared 4049569 event pairs, 42390 based on Foata normal form. 0/247290 useless extension candidates. Maximal degree in co-relation 316327. Up to 82476 conditions per place.