./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:49:03,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:49:03,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:49:03,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:49:03,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:49:03,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:49:03,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:49:03,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:49:03,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:49:03,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:49:03,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:49:03,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:49:03,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:49:03,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:49:03,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:49:03,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:49:03,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:03,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:49:03,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:49:03,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-03-04 06:49:04,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:49:04,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:49:04,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:49:04,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:49:04,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:49:04,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-04 06:49:05,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0269cb4e8/ed95052a8db244f48e177b497c2c5b74/FLAG4c08df20f [2025-03-04 06:49:05,553 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:49:05,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-04 06:49:05,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0269cb4e8/ed95052a8db244f48e177b497c2c5b74/FLAG4c08df20f [2025-03-04 06:49:05,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0269cb4e8/ed95052a8db244f48e177b497c2c5b74 [2025-03-04 06:49:05,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:49:05,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:49:05,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:05,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:49:05,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:49:05,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebdb406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:05, skipping insertion in model container [2025-03-04 06:49:05,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:05" (1/1) ... [2025-03-04 06:49:05,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:49:06,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:06,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:49:06,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:06,265 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:49:06,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06 WrapperNode [2025-03-04 06:49:06,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:06,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:06,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:49:06,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:49:06,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,300 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-03-04 06:49:06,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:06,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:49:06,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:49:06,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:49:06,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:49:06,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:49:06,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:49:06,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:49:06,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (1/1) ... [2025-03-04 06:49:06,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:06,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:49:06,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:49:06,364 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:49:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:49:06,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:49:06,365 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:49:06,449 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:49:06,450 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:49:06,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:49:06,619 INFO L1325 $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-03-04 06:49:06,674 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:49:06,675 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:49:06,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:49:06,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:49:06,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:06 BoogieIcfgContainer [2025-03-04 06:49:06,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:49:06,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:49:06,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:49:06,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:49:06,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:49:05" (1/3) ... [2025-03-04 06:49:06,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baebbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:06, skipping insertion in model container [2025-03-04 06:49:06,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:06" (2/3) ... [2025-03-04 06:49:06,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baebbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:06, skipping insertion in model container [2025-03-04 06:49:06,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:06" (3/3) ... [2025-03-04 06:49:06,709 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-03-04 06:49:06,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:49:06,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 133 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-04 06:49:06,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:49:06,774 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:49:06,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 144 transitions, 295 flow [2025-03-04 06:49:06,853 INFO L124 PetriNetUnfolderBase]: 15/201 cut-off events. [2025-03-04 06:49:06,854 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:06,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 201 events. 15/201 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 628 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place. [2025-03-04 06:49:06,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 144 transitions, 295 flow [2025-03-04 06:49:06,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 144 transitions, 295 flow [2025-03-04 06:49:06,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:06,878 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;@21b8c6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:06,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 06:49:06,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:06,893 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-04 06:49:06,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:06,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:06,893 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] [2025-03-04 06:49:06,894 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-03-04 06:49:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash 685736055, now seen corresponding path program 1 times [2025-03-04 06:49:06,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:06,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041903788] [2025-03-04 06:49:06,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:06,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:49:07,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:49:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:07,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:07,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041903788] [2025-03-04 06:49:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041903788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:07,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884735725] [2025-03-04 06:49:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:07,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:07,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:07,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2025-03-04 06:49:07,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:07,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:07,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2025-03-04 06:49:07,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:07,373 INFO L124 PetriNetUnfolderBase]: 48/499 cut-off events. [2025-03-04 06:49:07,375 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:49:07,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 499 events. 48/499 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2302 event pairs, 28 based on Foata normal form. 48/496 useless extension candidates. Maximal degree in co-relation 542. Up to 108 conditions per place. [2025-03-04 06:49:07,378 INFO L140 encePairwiseOnDemand]: 131/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-03-04 06:49:07,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 331 flow [2025-03-04 06:49:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-04 06:49:07,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2025-03-04 06:49:07,395 INFO L175 Difference]: Start difference. First operand has 136 places, 144 transitions, 295 flow. Second operand 3 states and 386 transitions. [2025-03-04 06:49:07,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 331 flow [2025-03-04 06:49:07,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:07,404 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 279 flow [2025-03-04 06:49:07,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-03-04 06:49:07,409 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2025-03-04 06:49:07,409 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 279 flow [2025-03-04 06:49:07,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:07,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:07,410 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-03-04 06:49:07,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:49:07,411 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-03-04 06:49:07,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1834565491, now seen corresponding path program 1 times [2025-03-04 06:49:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807123220] [2025-03-04 06:49:07,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:07,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:07,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:07,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:07,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:07,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807123220] [2025-03-04 06:49:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807123220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:07,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186677345] [2025-03-04 06:49:07,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:07,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:07,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:07,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:07,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 144 [2025-03-04 06:49:07,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:07,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:07,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 144 [2025-03-04 06:49:07,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:08,079 INFO L124 PetriNetUnfolderBase]: 108/632 cut-off events. [2025-03-04 06:49:08,080 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:49:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 632 events. 108/632 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3550 event pairs, 55 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 822. Up to 181 conditions per place. [2025-03-04 06:49:08,082 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 48 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2025-03-04 06:49:08,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 431 flow [2025-03-04 06:49:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2025-03-04 06:49:08,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-04 06:49:08,084 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 279 flow. Second operand 6 states and 672 transitions. [2025-03-04 06:49:08,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 431 flow [2025-03-04 06:49:08,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 155 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:08,087 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 283 flow [2025-03-04 06:49:08,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-03-04 06:49:08,087 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 3 predicate places. [2025-03-04 06:49:08,087 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 283 flow [2025-03-04 06:49:08,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:08,088 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] [2025-03-04 06:49:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:49:08,091 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-03-04 06:49:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -907798778, now seen corresponding path program 1 times [2025-03-04 06:49:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189220247] [2025-03-04 06:49:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:08,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:08,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:08,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189220247] [2025-03-04 06:49:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189220247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790216001] [2025-03-04 06:49:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:08,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:08,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:08,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2025-03-04 06:49:08,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:08,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2025-03-04 06:49:08,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:08,265 INFO L124 PetriNetUnfolderBase]: 91/792 cut-off events. [2025-03-04 06:49:08,265 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:49:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 792 events. 91/792 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4665 event pairs, 30 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 959. Up to 125 conditions per place. [2025-03-04 06:49:08,268 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-03-04 06:49:08,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 144 transitions, 384 flow [2025-03-04 06:49:08,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-03-04 06:49:08,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-04 06:49:08,273 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 283 flow. Second operand 3 states and 369 transitions. [2025-03-04 06:49:08,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 144 transitions, 384 flow [2025-03-04 06:49:08,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:08,276 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 311 flow [2025-03-04 06:49:08,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-03-04 06:49:08,278 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2025-03-04 06:49:08,278 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 311 flow [2025-03-04 06:49:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:08,279 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] [2025-03-04 06:49:08,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:49:08,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:49:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 546477631, now seen corresponding path program 1 times [2025-03-04 06:49:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425627164] [2025-03-04 06:49:08,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:08,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:49:08,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:49:08,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:08,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425627164] [2025-03-04 06:49:08,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425627164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:08,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:08,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906747615] [2025-03-04 06:49:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:08,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:08,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:08,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:08,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:08,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2025-03-04 06:49:08,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:08,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2025-03-04 06:49:08,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:08,457 INFO L124 PetriNetUnfolderBase]: 94/791 cut-off events. [2025-03-04 06:49:08,457 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-04 06:49:08,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 791 events. 94/791 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4757 event pairs, 60 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1056. Up to 189 conditions per place. [2025-03-04 06:49:08,461 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 27 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-03-04 06:49:08,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 140 transitions, 391 flow [2025-03-04 06:49:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-03-04 06:49:08,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2025-03-04 06:49:08,463 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 311 flow. Second operand 3 states and 365 transitions. [2025-03-04 06:49:08,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 140 transitions, 391 flow [2025-03-04 06:49:08,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 140 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:08,467 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 331 flow [2025-03-04 06:49:08,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-03-04 06:49:08,468 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-03-04 06:49:08,469 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 331 flow [2025-03-04 06:49:08,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:08,469 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-03-04 06:49:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:49:08,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:49:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1689791727, now seen corresponding path program 1 times [2025-03-04 06:49:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480868354] [2025-03-04 06:49:08,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:49:08,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:49:08,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:08,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:49:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:49:08,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:49:08,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:08,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:49:08,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:49:08,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-04 06:49:08,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-04 06:49:08,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-04 06:49:08,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:49:08,529 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:49:08,531 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:49:08,532 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:49:08,555 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:49:08,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 192 transitions, 400 flow [2025-03-04 06:49:08,596 INFO L124 PetriNetUnfolderBase]: 27/333 cut-off events. [2025-03-04 06:49:08,596 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:49:08,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 333 events. 27/333 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1175 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 203. Up to 6 conditions per place. [2025-03-04 06:49:08,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 192 transitions, 400 flow [2025-03-04 06:49:08,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 192 transitions, 400 flow [2025-03-04 06:49:08,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:08,604 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21b8c6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:08,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 06:49:08,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:08,609 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-04 06:49:08,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:08,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:08,610 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] [2025-03-04 06:49:08,611 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-03-04 06:49:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2041405559, now seen corresponding path program 1 times [2025-03-04 06:49:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810259386] [2025-03-04 06:49:08,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:08,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:49:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:49:08,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:08,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810259386] [2025-03-04 06:49:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810259386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:08,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898135677] [2025-03-04 06:49:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:08,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:08,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:08,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 192 [2025-03-04 06:49:08,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 192 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:08,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:08,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 192 [2025-03-04 06:49:08,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:09,103 INFO L124 PetriNetUnfolderBase]: 788/4187 cut-off events. [2025-03-04 06:49:09,104 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 06:49:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 4187 events. 788/4187 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39255 event pairs, 632 based on Foata normal form. 562/4357 useless extension candidates. Maximal degree in co-relation 3459. Up to 1303 conditions per place. [2025-03-04 06:49:09,150 INFO L140 encePairwiseOnDemand]: 173/192 looper letters, 31 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-03-04 06:49:09,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 181 transitions, 444 flow [2025-03-04 06:49:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-04 06:49:09,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732638888888888 [2025-03-04 06:49:09,152 INFO L175 Difference]: Start difference. First operand has 179 places, 192 transitions, 400 flow. Second operand 3 states and 503 transitions. [2025-03-04 06:49:09,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 181 transitions, 444 flow [2025-03-04 06:49:09,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 181 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:09,154 INFO L231 Difference]: Finished difference. Result has 180 places, 175 transitions, 376 flow [2025-03-04 06:49:09,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=180, PETRI_TRANSITIONS=175} [2025-03-04 06:49:09,158 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 1 predicate places. [2025-03-04 06:49:09,158 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 376 flow [2025-03-04 06:49:09,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:09,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:09,158 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-03-04 06:49:09,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:49:09,158 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-03-04 06:49:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash -411256691, now seen corresponding path program 1 times [2025-03-04 06:49:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183955018] [2025-03-04 06:49:09,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:09,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:09,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:09,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:09,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183955018] [2025-03-04 06:49:09,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183955018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:09,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:09,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295218429] [2025-03-04 06:49:09,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:09,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:09,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:09,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:09,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:09,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 192 [2025-03-04 06:49:09,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:09,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:09,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 192 [2025-03-04 06:49:09,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:10,145 INFO L124 PetriNetUnfolderBase]: 1718/6114 cut-off events. [2025-03-04 06:49:10,146 INFO L125 PetriNetUnfolderBase]: For 128/130 co-relation queries the response was YES. [2025-03-04 06:49:10,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9094 conditions, 6114 events. 1718/6114 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 58900 event pairs, 580 based on Foata normal form. 0/5643 useless extension candidates. Maximal degree in co-relation 6515. Up to 2015 conditions per place. [2025-03-04 06:49:10,176 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 80 selfloop transitions, 6 changer transitions 0/222 dead transitions. [2025-03-04 06:49:10,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 222 transitions, 642 flow [2025-03-04 06:49:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 908 transitions. [2025-03-04 06:49:10,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881944444444444 [2025-03-04 06:49:10,179 INFO L175 Difference]: Start difference. First operand has 180 places, 175 transitions, 376 flow. Second operand 6 states and 908 transitions. [2025-03-04 06:49:10,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 222 transitions, 642 flow [2025-03-04 06:49:10,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 222 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:49:10,183 INFO L231 Difference]: Finished difference. Result has 183 places, 174 transitions, 384 flow [2025-03-04 06:49:10,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=183, PETRI_TRANSITIONS=174} [2025-03-04 06:49:10,185 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 4 predicate places. [2025-03-04 06:49:10,185 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 174 transitions, 384 flow [2025-03-04 06:49:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:10,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:10,186 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] [2025-03-04 06:49:10,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:49:10,187 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-03-04 06:49:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1473543960, now seen corresponding path program 1 times [2025-03-04 06:49:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957554087] [2025-03-04 06:49:10,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:10,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:10,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957554087] [2025-03-04 06:49:10,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957554087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:10,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:10,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074951077] [2025-03-04 06:49:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:10,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:10,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:10,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:10,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 192 [2025-03-04 06:49:10,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 174 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:10,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:10,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 192 [2025-03-04 06:49:10,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:11,526 INFO L124 PetriNetUnfolderBase]: 3895/14450 cut-off events. [2025-03-04 06:49:11,526 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-04 06:49:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21008 conditions, 14450 events. 3895/14450 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 161769 event pairs, 1409 based on Foata normal form. 0/12955 useless extension candidates. Maximal degree in co-relation 14553. Up to 3516 conditions per place. [2025-03-04 06:49:11,602 INFO L140 encePairwiseOnDemand]: 173/192 looper letters, 58 selfloop transitions, 14 changer transitions 0/207 dead transitions. [2025-03-04 06:49:11,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 207 transitions, 605 flow [2025-03-04 06:49:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-04 06:49:11,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8420138888888888 [2025-03-04 06:49:11,604 INFO L175 Difference]: Start difference. First operand has 183 places, 174 transitions, 384 flow. Second operand 3 states and 485 transitions. [2025-03-04 06:49:11,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 207 transitions, 605 flow [2025-03-04 06:49:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 593 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:11,609 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 494 flow [2025-03-04 06:49:11,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2025-03-04 06:49:11,610 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 3 predicate places. [2025-03-04 06:49:11,610 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 494 flow [2025-03-04 06:49:11,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:11,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:11,611 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] [2025-03-04 06:49:11,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:49:11,611 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-03-04 06:49:11,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1782987309, now seen corresponding path program 1 times [2025-03-04 06:49:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:11,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858796374] [2025-03-04 06:49:11,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:11,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:49:11,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:49:11,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:11,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858796374] [2025-03-04 06:49:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858796374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402212247] [2025-03-04 06:49:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:11,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:11,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-04 06:49:11,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:11,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:11,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-04 06:49:11,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:13,083 INFO L124 PetriNetUnfolderBase]: 4014/16225 cut-off events. [2025-03-04 06:49:13,083 INFO L125 PetriNetUnfolderBase]: For 4248/4425 co-relation queries the response was YES. [2025-03-04 06:49:13,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26903 conditions, 16225 events. 4014/16225 cut-off events. For 4248/4425 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 190394 event pairs, 2405 based on Foata normal form. 51/14772 useless extension candidates. Maximal degree in co-relation 13663. Up to 5485 conditions per place. [2025-03-04 06:49:13,151 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 52 selfloop transitions, 14 changer transitions 0/212 dead transitions. [2025-03-04 06:49:13,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 212 transitions, 712 flow [2025-03-04 06:49:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-04 06:49:13,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315972222222222 [2025-03-04 06:49:13,154 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 494 flow. Second operand 3 states and 479 transitions. [2025-03-04 06:49:13,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 212 transitions, 712 flow [2025-03-04 06:49:13,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 212 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:13,166 INFO L231 Difference]: Finished difference. Result has 184 places, 200 transitions, 592 flow [2025-03-04 06:49:13,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=184, PETRI_TRANSITIONS=200} [2025-03-04 06:49:13,167 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 5 predicate places. [2025-03-04 06:49:13,168 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 200 transitions, 592 flow [2025-03-04 06:49:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:13,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:13,168 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] [2025-03-04 06:49:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:49:13,168 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-03-04 06:49:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1663324472, now seen corresponding path program 1 times [2025-03-04 06:49:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156393611] [2025-03-04 06:49:13,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:13,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:49:13,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:49:13,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:13,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:49:13,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156393611] [2025-03-04 06:49:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156393611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544460101] [2025-03-04 06:49:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:13,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:49:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:13,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:49:13,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:49:13,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 192 [2025-03-04 06:49:13,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 200 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:13,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:13,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 192 [2025-03-04 06:49:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:14,630 INFO L124 PetriNetUnfolderBase]: 3076/17673 cut-off events. [2025-03-04 06:49:14,630 INFO L125 PetriNetUnfolderBase]: For 1402/1935 co-relation queries the response was YES. [2025-03-04 06:49:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25147 conditions, 17673 events. 3076/17673 cut-off events. For 1402/1935 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 230486 event pairs, 608 based on Foata normal form. 16/15815 useless extension candidates. Maximal degree in co-relation 11369. Up to 3818 conditions per place. [2025-03-04 06:49:14,704 INFO L140 encePairwiseOnDemand]: 187/192 looper letters, 56 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-03-04 06:49:14,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 232 transitions, 778 flow [2025-03-04 06:49:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2025-03-04 06:49:14,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2025-03-04 06:49:14,706 INFO L175 Difference]: Start difference. First operand has 184 places, 200 transitions, 592 flow. Second operand 6 states and 944 transitions. [2025-03-04 06:49:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 232 transitions, 778 flow [2025-03-04 06:49:14,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 232 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:14,713 INFO L231 Difference]: Finished difference. Result has 190 places, 202 transitions, 590 flow [2025-03-04 06:49:14,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=190, PETRI_TRANSITIONS=202} [2025-03-04 06:49:14,713 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 11 predicate places. [2025-03-04 06:49:14,714 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 202 transitions, 590 flow [2025-03-04 06:49:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:14,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:14,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:49:14,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:49:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1197139330, now seen corresponding path program 1 times [2025-03-04 06:49:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868431593] [2025-03-04 06:49:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:14,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:49:14,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:49:14,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:14,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:49:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:14,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868431593] [2025-03-04 06:49:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868431593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119789417] [2025-03-04 06:49:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:14,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:14,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-04 06:49:14,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 202 transitions, 590 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-03-04 06:49:14,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:14,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-04 06:49:14,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:16,428 INFO L124 PetriNetUnfolderBase]: 4654/19844 cut-off events. [2025-03-04 06:49:16,428 INFO L125 PetriNetUnfolderBase]: For 5063/5252 co-relation queries the response was YES. [2025-03-04 06:49:16,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32363 conditions, 19844 events. 4654/19844 cut-off events. For 5063/5252 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 246766 event pairs, 2715 based on Foata normal form. 35/17833 useless extension candidates. Maximal degree in co-relation 32173. Up to 6268 conditions per place. [2025-03-04 06:49:16,554 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 59 selfloop transitions, 17 changer transitions 0/226 dead transitions. [2025-03-04 06:49:16,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 226 transitions, 825 flow [2025-03-04 06:49:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2025-03-04 06:49:16,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2025-03-04 06:49:16,556 INFO L175 Difference]: Start difference. First operand has 190 places, 202 transitions, 590 flow. Second operand 3 states and 478 transitions. [2025-03-04 06:49:16,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 226 transitions, 825 flow [2025-03-04 06:49:16,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 226 transitions, 819 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:16,561 INFO L231 Difference]: Finished difference. Result has 192 places, 215 transitions, 738 flow [2025-03-04 06:49:16,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=192, PETRI_TRANSITIONS=215} [2025-03-04 06:49:16,562 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 13 predicate places. [2025-03-04 06:49:16,562 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 215 transitions, 738 flow [2025-03-04 06:49:16,562 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-03-04 06:49:16,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:16,562 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, 1] [2025-03-04 06:49:16,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:49:16,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:49:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1782047815, now seen corresponding path program 1 times [2025-03-04 06:49:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555821265] [2025-03-04 06:49:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:49:16,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:49:16,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:49:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555821265] [2025-03-04 06:49:16,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555821265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:16,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:16,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726792302] [2025-03-04 06:49:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:16,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:16,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:16,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:16,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-04 06:49:16,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 215 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:16,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:16,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-04 06:49:16,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:18,318 INFO L124 PetriNetUnfolderBase]: 5220/22361 cut-off events. [2025-03-04 06:49:18,319 INFO L125 PetriNetUnfolderBase]: For 12697/13118 co-relation queries the response was YES. [2025-03-04 06:49:18,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39547 conditions, 22361 events. 5220/22361 cut-off events. For 12697/13118 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 283933 event pairs, 2889 based on Foata normal form. 60/20140 useless extension candidates. Maximal degree in co-relation 39336. Up to 7039 conditions per place. [2025-03-04 06:49:18,651 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 71 selfloop transitions, 17 changer transitions 0/240 dead transitions. [2025-03-04 06:49:18,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 240 transitions, 1032 flow [2025-03-04 06:49:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-04 06:49:18,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315972222222222 [2025-03-04 06:49:18,653 INFO L175 Difference]: Start difference. First operand has 192 places, 215 transitions, 738 flow. Second operand 3 states and 479 transitions. [2025-03-04 06:49:18,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 240 transitions, 1032 flow [2025-03-04 06:49:18,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 240 transitions, 992 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:18,672 INFO L231 Difference]: Finished difference. Result has 194 places, 228 transitions, 880 flow [2025-03-04 06:49:18,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=194, PETRI_TRANSITIONS=228} [2025-03-04 06:49:18,673 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 15 predicate places. [2025-03-04 06:49:18,673 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 228 transitions, 880 flow [2025-03-04 06:49:18,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:18,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:18,674 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-03-04 06:49:18,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:49:18,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:49:18,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1772059838, now seen corresponding path program 1 times [2025-03-04 06:49:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750945109] [2025-03-04 06:49:18,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:18,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:49:18,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:49:18,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:18,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:18,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:49:18,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:49:18,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:49:18,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:18,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:18,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:49:18,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:49:18,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 06:49:18,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-04 06:49:18,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-04 06:49:18,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-04 06:49:18,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-04 06:49:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-04 06:49:18,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-04 06:49:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:49:18,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:18,714 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:49:18,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:49:18,737 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:49:18,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 240 transitions, 507 flow [2025-03-04 06:49:18,769 INFO L124 PetriNetUnfolderBase]: 42/508 cut-off events. [2025-03-04 06:49:18,769 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:49:18,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 508 events. 42/508 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1971 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 341. Up to 12 conditions per place. [2025-03-04 06:49:18,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 240 transitions, 507 flow [2025-03-04 06:49:18,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 240 transitions, 507 flow [2025-03-04 06:49:18,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:18,779 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;@21b8c6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:18,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:49:18,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:18,781 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-04 06:49:18,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:18,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:18,782 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] [2025-03-04 06:49:18,782 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-03-04 06:49:18,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -558974857, now seen corresponding path program 1 times [2025-03-04 06:49:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435754576] [2025-03-04 06:49:18,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:18,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:49:18,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:49:18,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:18,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435754576] [2025-03-04 06:49:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435754576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569379998] [2025-03-04 06:49:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:18,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:18,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:18,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:18,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 240 [2025-03-04 06:49:18,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 240 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:18,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:18,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 240 [2025-03-04 06:49:18,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:21,689 INFO L124 PetriNetUnfolderBase]: 8949/34641 cut-off events. [2025-03-04 06:49:21,689 INFO L125 PetriNetUnfolderBase]: For 943/943 co-relation queries the response was YES. [2025-03-04 06:49:21,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47885 conditions, 34641 events. 8949/34641 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 446629 event pairs, 7791 based on Foata normal form. 5647/37038 useless extension candidates. Maximal degree in co-relation 29234. Up to 12807 conditions per place. [2025-03-04 06:49:21,919 INFO L140 encePairwiseOnDemand]: 215/240 looper letters, 39 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-04 06:49:21,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 223 transitions, 555 flow [2025-03-04 06:49:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2025-03-04 06:49:21,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597222222222223 [2025-03-04 06:49:21,921 INFO L175 Difference]: Start difference. First operand has 222 places, 240 transitions, 507 flow. Second operand 3 states and 619 transitions. [2025-03-04 06:49:21,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 223 transitions, 555 flow [2025-03-04 06:49:21,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:21,925 INFO L231 Difference]: Finished difference. Result has 223 places, 217 transitions, 471 flow [2025-03-04 06:49:21,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=223, PETRI_TRANSITIONS=217} [2025-03-04 06:49:21,926 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 1 predicate places. [2025-03-04 06:49:21,926 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 217 transitions, 471 flow [2025-03-04 06:49:21,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:21,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:21,926 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-03-04 06:49:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:49:21,926 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-03-04 06:49:21,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash 294137485, now seen corresponding path program 1 times [2025-03-04 06:49:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731987223] [2025-03-04 06:49:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:21,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:21,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:21,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:21,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731987223] [2025-03-04 06:49:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731987223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988682095] [2025-03-04 06:49:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:22,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:22,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:22,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 240 [2025-03-04 06:49:22,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 217 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:22,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:22,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 240 [2025-03-04 06:49:22,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:26,978 INFO L124 PetriNetUnfolderBase]: 19563/53265 cut-off events. [2025-03-04 06:49:26,979 INFO L125 PetriNetUnfolderBase]: For 1427/1429 co-relation queries the response was YES. [2025-03-04 06:49:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82213 conditions, 53265 events. 19563/53265 cut-off events. For 1427/1429 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 652416 event pairs, 5270 based on Foata normal form. 0/49645 useless extension candidates. Maximal degree in co-relation 59099. Up to 20064 conditions per place. [2025-03-04 06:49:27,279 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 112 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2025-03-04 06:49:27,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 288 transitions, 849 flow [2025-03-04 06:49:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2025-03-04 06:49:27,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944444444444444 [2025-03-04 06:49:27,282 INFO L175 Difference]: Start difference. First operand has 223 places, 217 transitions, 471 flow. Second operand 6 states and 1144 transitions. [2025-03-04 06:49:27,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 288 transitions, 849 flow [2025-03-04 06:49:27,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 288 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:49:27,287 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 479 flow [2025-03-04 06:49:27,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2025-03-04 06:49:27,288 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 4 predicate places. [2025-03-04 06:49:27,288 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 479 flow [2025-03-04 06:49:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:27,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:27,288 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] [2025-03-04 06:49:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:49:27,289 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-03-04 06:49:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1013298426, now seen corresponding path program 1 times [2025-03-04 06:49:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569443044] [2025-03-04 06:49:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:27,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569443044] [2025-03-04 06:49:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569443044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125202951] [2025-03-04 06:49:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:27,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:27,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:27,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 240 [2025-03-04 06:49:27,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:49:27,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:27,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 240 [2025-03-04 06:49:27,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand