./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.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_42-trylock2_racefree.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 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:02,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:02,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:50:02,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:02,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:02,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:02,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:02,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:02,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:02,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:02,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:02,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:02,829 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:02,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:02,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:02,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:02,830 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 -> 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 [2025-03-04 06:50:03,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:03,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:03,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:03,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:03,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:03,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-03-04 06:50:04,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d203bb98e/42d9895a722a46c4af63b365eccc4cfb/FLAGfd2fc1ded [2025-03-04 06:50:04,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:04,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-03-04 06:50:04,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d203bb98e/42d9895a722a46c4af63b365eccc4cfb/FLAGfd2fc1ded [2025-03-04 06:50:04,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d203bb98e/42d9895a722a46c4af63b365eccc4cfb [2025-03-04 06:50:04,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:04,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:04,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:04,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:04,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:04,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:04" (1/1) ... [2025-03-04 06:50:04,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aadf523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:04, skipping insertion in model container [2025-03-04 06:50:04,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:04" (1/1) ... [2025-03-04 06:50:04,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:05,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:05,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:05,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:05,149 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:05,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05 WrapperNode [2025-03-04 06:50:05,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:05,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:05,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:05,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:05,157 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:50:05" (1/1) ... [2025-03-04 06:50:05,165 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:50:05" (1/1) ... [2025-03-04 06:50:05,180 INFO L138 Inliner]: procedures = 172, calls = 61, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 165 [2025-03-04 06:50:05,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:05,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:05,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:05,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:05,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:05,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:05,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:05,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:05,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (1/1) ... [2025-03-04 06:50:05,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:05,229 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:50:05,232 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:50:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:05,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:05,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:05,251 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:50:05,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:05,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:05,608 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:05,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:50:05,690 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:05,690 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:05,730 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:05,731 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:05,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:05 BoogieIcfgContainer [2025-03-04 06:50:05,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:05,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:05,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:05,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:05,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:04" (1/3) ... [2025-03-04 06:50:05,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2598dbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:05, skipping insertion in model container [2025-03-04 06:50:05,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:05" (2/3) ... [2025-03-04 06:50:05,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2598dbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:05, skipping insertion in model container [2025-03-04 06:50:05,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:05" (3/3) ... [2025-03-04 06:50:05,740 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2025-03-04 06:50:05,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:05,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_42-trylock2_racefree.i that has 2 procedures, 238 locations, 1 initial locations, 11 loop locations, and 14 error locations. [2025-03-04 06:50:05,751 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:05,817 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:05,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 269 transitions, 545 flow [2025-03-04 06:50:05,942 INFO L124 PetriNetUnfolderBase]: 49/407 cut-off events. [2025-03-04 06:50:05,944 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:05,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 407 events. 49/407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1906 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 230. Up to 6 conditions per place. [2025-03-04 06:50:05,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 269 transitions, 545 flow [2025-03-04 06:50:05,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 269 transitions, 545 flow [2025-03-04 06:50:05,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:05,980 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;@7f3b1da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:05,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:05,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:05,989 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2025-03-04 06:50:05,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:05,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:05,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:05,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1241543291, now seen corresponding path program 1 times [2025-03-04 06:50:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-03-04 06:50:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:06,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:06,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:06,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:06,246 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:50:06,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:06,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619833899] [2025-03-04 06:50:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619833899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:06,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-03-04 06:50:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:06,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:06,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:06,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:06,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 269 [2025-03-04 06:50:06,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 269 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 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:50:06,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:06,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 269 [2025-03-04 06:50:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:06,635 INFO L124 PetriNetUnfolderBase]: 229/1788 cut-off events. [2025-03-04 06:50:06,635 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:50:06,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 1788 events. 229/1788 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12066 event pairs, 170 based on Foata normal form. 269/1872 useless extension candidates. Maximal degree in co-relation 2182. Up to 454 conditions per place. [2025-03-04 06:50:06,651 INFO L140 encePairwiseOnDemand]: 237/269 looper letters, 44 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2025-03-04 06:50:06,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 244 transitions, 587 flow [2025-03-04 06:50:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-04 06:50:06,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599752168525403 [2025-03-04 06:50:06,668 INFO L175 Difference]: Start difference. First operand has 241 places, 269 transitions, 545 flow. Second operand 3 states and 694 transitions. [2025-03-04 06:50:06,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 244 transitions, 587 flow [2025-03-04 06:50:06,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 244 transitions, 587 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:06,678 INFO L231 Difference]: Finished difference. Result has 236 places, 232 transitions, 479 flow [2025-03-04 06:50:06,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=236, PETRI_TRANSITIONS=232} [2025-03-04 06:50:06,684 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -5 predicate places. [2025-03-04 06:50:06,684 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 232 transitions, 479 flow [2025-03-04 06:50:06,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 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:50:06,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:06,685 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] [2025-03-04 06:50:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:06,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1970036470, now seen corresponding path program 1 times [2025-03-04 06:50:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-03-04 06:50:06,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:50:06,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:50:06,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:06,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:07,137 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:50:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128322151] [2025-03-04 06:50:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128322151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910551597] [2025-03-04 06:50:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:07,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:07,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:07,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:07,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 269 [2025-03-04 06:50:07,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 232 transitions, 479 flow. Second operand has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:50:07,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:07,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 269 [2025-03-04 06:50:07,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:07,599 INFO L124 PetriNetUnfolderBase]: 349/2089 cut-off events. [2025-03-04 06:50:07,599 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 06:50:07,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 2089 events. 349/2089 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15103 event pairs, 24 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2775. Up to 587 conditions per place. [2025-03-04 06:50:07,612 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 88 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2025-03-04 06:50:07,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 279 transitions, 759 flow [2025-03-04 06:50:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1234 transitions. [2025-03-04 06:50:07,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7645600991325898 [2025-03-04 06:50:07,616 INFO L175 Difference]: Start difference. First operand has 236 places, 232 transitions, 479 flow. Second operand 6 states and 1234 transitions. [2025-03-04 06:50:07,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 279 transitions, 759 flow [2025-03-04 06:50:07,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 279 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:07,622 INFO L231 Difference]: Finished difference. Result has 238 places, 231 transitions, 483 flow [2025-03-04 06:50:07,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=238, PETRI_TRANSITIONS=231} [2025-03-04 06:50:07,623 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2025-03-04 06:50:07,623 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 231 transitions, 483 flow [2025-03-04 06:50:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:50:07,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:07,624 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] [2025-03-04 06:50:07,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:50:07,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:07,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1165062392, now seen corresponding path program 1 times [2025-03-04 06:50:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:07,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079630551] [2025-03-04 06:50:07,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:07,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:50:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:50:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:07,686 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:50:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079630551] [2025-03-04 06:50:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079630551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972420996] [2025-03-04 06:50:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:07,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:07,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:07,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:07,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 269 [2025-03-04 06:50:07,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 231 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 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:50:07,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:07,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 269 [2025-03-04 06:50:07,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:08,129 INFO L124 PetriNetUnfolderBase]: 596/3757 cut-off events. [2025-03-04 06:50:08,129 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:50:08,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5015 conditions, 3757 events. 596/3757 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31739 event pairs, 110 based on Foata normal form. 0/3400 useless extension candidates. Maximal degree in co-relation 4945. Up to 735 conditions per place. [2025-03-04 06:50:08,142 INFO L140 encePairwiseOnDemand]: 254/269 looper letters, 68 selfloop transitions, 10 changer transitions 0/264 dead transitions. [2025-03-04 06:50:08,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 264 transitions, 708 flow [2025-03-04 06:50:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-03-04 06:50:08,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8128872366790583 [2025-03-04 06:50:08,144 INFO L175 Difference]: Start difference. First operand has 238 places, 231 transitions, 483 flow. Second operand 3 states and 656 transitions. [2025-03-04 06:50:08,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 264 transitions, 708 flow [2025-03-04 06:50:08,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 264 transitions, 698 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:08,148 INFO L231 Difference]: Finished difference. Result has 235 places, 237 transitions, 547 flow [2025-03-04 06:50:08,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=235, PETRI_TRANSITIONS=237} [2025-03-04 06:50:08,150 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -6 predicate places. [2025-03-04 06:50:08,150 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 237 transitions, 547 flow [2025-03-04 06:50:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 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:50:08,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:08,150 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] [2025-03-04 06:50:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:08,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1665625903, now seen corresponding path program 1 times [2025-03-04 06:50:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361183517] [2025-03-04 06:50:08,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:50:08,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:50:08,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:08,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:08,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361183517] [2025-03-04 06:50:08,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361183517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017502421] [2025-03-04 06:50:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:08,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:08,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:08,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:08,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 269 [2025-03-04 06:50:08,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 237 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:50:08,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 269 [2025-03-04 06:50:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:08,583 INFO L124 PetriNetUnfolderBase]: 592/3760 cut-off events. [2025-03-04 06:50:08,583 INFO L125 PetriNetUnfolderBase]: For 412/416 co-relation queries the response was YES. [2025-03-04 06:50:08,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 3760 events. 592/3760 cut-off events. For 412/416 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 31716 event pairs, 409 based on Foata normal form. 4/3399 useless extension candidates. Maximal degree in co-relation 5322. Up to 1109 conditions per place. [2025-03-04 06:50:08,595 INFO L140 encePairwiseOnDemand]: 262/269 looper letters, 57 selfloop transitions, 8 changer transitions 0/258 dead transitions. [2025-03-04 06:50:08,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 258 transitions, 735 flow [2025-03-04 06:50:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-03-04 06:50:08,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.80545229244114 [2025-03-04 06:50:08,597 INFO L175 Difference]: Start difference. First operand has 235 places, 237 transitions, 547 flow. Second operand 3 states and 650 transitions. [2025-03-04 06:50:08,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 258 transitions, 735 flow [2025-03-04 06:50:08,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 258 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:08,601 INFO L231 Difference]: Finished difference. Result has 237 places, 244 transitions, 599 flow [2025-03-04 06:50:08,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=237, PETRI_TRANSITIONS=244} [2025-03-04 06:50:08,602 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -4 predicate places. [2025-03-04 06:50:08,602 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 244 transitions, 599 flow [2025-03-04 06:50:08,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:50:08,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:08,603 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] [2025-03-04 06:50:08,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:08,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:08,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2129851118, now seen corresponding path program 1 times [2025-03-04 06:50:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:08,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969988712] [2025-03-04 06:50:08,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:08,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:50:08,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:50:08,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:08,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:08,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:50:08,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:50:08,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:08,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:08,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:08,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:08,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 06:50:08,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-04 06:50:08,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-04 06:50:08,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-04 06:50:08,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-04 06:50:08,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-04 06:50:08,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:50:08,646 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:50:08,648 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:08,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:08,674 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:08,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 360 transitions, 736 flow [2025-03-04 06:50:08,719 INFO L124 PetriNetUnfolderBase]: 81/663 cut-off events. [2025-03-04 06:50:08,719 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:08,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 663 events. 81/663 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3378 event pairs, 0 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 409. Up to 9 conditions per place. [2025-03-04 06:50:08,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 360 transitions, 736 flow [2025-03-04 06:50:08,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 360 transitions, 736 flow [2025-03-04 06:50:08,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:08,731 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;@7f3b1da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:08,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 06:50:08,734 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:08,734 INFO L124 PetriNetUnfolderBase]: 1/61 cut-off events. [2025-03-04 06:50:08,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:08,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:08,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:08,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 247335661, now seen corresponding path program 1 times [2025-03-04 06:50:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-04 06:50:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 06:50:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 06:50:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:08,774 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:50:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-04 06:50:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249493946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829842769] [2025-03-04 06:50:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:08,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:08,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:08,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 360 [2025-03-04 06:50:08,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 360 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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:50:08,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:08,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 360 [2025-03-04 06:50:08,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:11,523 INFO L124 PetriNetUnfolderBase]: 6064/28206 cut-off events. [2025-03-04 06:50:11,523 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-03-04 06:50:11,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37805 conditions, 28206 events. 6064/28206 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 351362 event pairs, 2832 based on Foata normal form. 5073/30734 useless extension candidates. Maximal degree in co-relation 2753. Up to 9513 conditions per place. [2025-03-04 06:50:11,697 INFO L140 encePairwiseOnDemand]: 316/360 looper letters, 59 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-04 06:50:11,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 324 transitions, 786 flow [2025-03-04 06:50:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-03-04 06:50:11,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481481481481481 [2025-03-04 06:50:11,700 INFO L175 Difference]: Start difference. First operand has 321 places, 360 transitions, 736 flow. Second operand 3 states and 916 transitions. [2025-03-04 06:50:11,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 324 transitions, 786 flow [2025-03-04 06:50:11,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 324 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:11,705 INFO L231 Difference]: Finished difference. Result has 316 places, 312 transitions, 650 flow [2025-03-04 06:50:11,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=316, PETRI_TRANSITIONS=312} [2025-03-04 06:50:11,708 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -5 predicate places. [2025-03-04 06:50:11,708 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 312 transitions, 650 flow [2025-03-04 06:50:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 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:50:11,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:11,709 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] [2025-03-04 06:50:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:50:11,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1381461646, now seen corresponding path program 1 times [2025-03-04 06:50:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-04 06:50:11,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:11,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:50:11,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:50:11,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-04 06:50:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965032409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98134421] [2025-03-04 06:50:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:12,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 360 [2025-03-04 06:50:12,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 312 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 256.5) internal successors, (1539), 6 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:50:12,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:12,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 360 [2025-03-04 06:50:12,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:15,429 INFO L124 PetriNetUnfolderBase]: 9430/34962 cut-off events. [2025-03-04 06:50:15,429 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2025-03-04 06:50:15,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49995 conditions, 34962 events. 9430/34962 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 426085 event pairs, 4061 based on Foata normal form. 0/32137 useless extension candidates. Maximal degree in co-relation 33444. Up to 11851 conditions per place. [2025-03-04 06:50:15,662 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 150 selfloop transitions, 6 changer transitions 0/407 dead transitions. [2025-03-04 06:50:15,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 407 transitions, 1152 flow [2025-03-04 06:50:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1686 transitions. [2025-03-04 06:50:15,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7805555555555556 [2025-03-04 06:50:15,667 INFO L175 Difference]: Start difference. First operand has 316 places, 312 transitions, 650 flow. Second operand 6 states and 1686 transitions. [2025-03-04 06:50:15,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 407 transitions, 1152 flow [2025-03-04 06:50:15,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 407 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:15,675 INFO L231 Difference]: Finished difference. Result has 319 places, 311 transitions, 658 flow [2025-03-04 06:50:15,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=319, PETRI_TRANSITIONS=311} [2025-03-04 06:50:15,677 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -2 predicate places. [2025-03-04 06:50:15,678 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 311 transitions, 658 flow [2025-03-04 06:50:15,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.5) internal successors, (1539), 6 states have internal predecessors, (1539), 0 states have call successors, (0), 0 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:50:15,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:15,679 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] [2025-03-04 06:50:15,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:15,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:15,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1998502169, now seen corresponding path program 1 times [2025-03-04 06:50:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682454154] [2025-03-04 06:50:15,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:15,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:50:15,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:50:15,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:15,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:15,724 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:50:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:15,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682454154] [2025-03-04 06:50:15,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682454154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:15,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:15,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475941743] [2025-03-04 06:50:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:15,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:15,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:15,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:15,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 360 [2025-03-04 06:50:15,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 311 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 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:50:15,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:15,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 360 [2025-03-04 06:50:15,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:24,586 INFO L124 PetriNetUnfolderBase]: 30965/107994 cut-off events. [2025-03-04 06:50:24,586 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-03-04 06:50:24,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156532 conditions, 107994 events. 30965/107994 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 1532379 event pairs, 10342 based on Foata normal form. 0/96607 useless extension candidates. Maximal degree in co-relation 125292. Up to 26160 conditions per place. [2025-03-04 06:50:25,299 INFO L140 encePairwiseOnDemand]: 335/360 looper letters, 108 selfloop transitions, 18 changer transitions 0/370 dead transitions. [2025-03-04 06:50:25,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 370 transitions, 1039 flow [2025-03-04 06:50:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2025-03-04 06:50:25,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.812037037037037 [2025-03-04 06:50:25,301 INFO L175 Difference]: Start difference. First operand has 319 places, 311 transitions, 658 flow. Second operand 3 states and 877 transitions. [2025-03-04 06:50:25,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 370 transitions, 1039 flow [2025-03-04 06:50:25,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 1027 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:50:25,308 INFO L231 Difference]: Finished difference. Result has 318 places, 329 transitions, 804 flow [2025-03-04 06:50:25,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=318, PETRI_TRANSITIONS=329} [2025-03-04 06:50:25,308 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -3 predicate places. [2025-03-04 06:50:25,309 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 329 transitions, 804 flow [2025-03-04 06:50:25,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 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:50:25,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:25,309 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] [2025-03-04 06:50:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:25,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 298130952, now seen corresponding path program 1 times [2025-03-04 06:50:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-04 06:50:25,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:50:25,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:50:25,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:25,342 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:50:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:25,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097997250] [2025-03-04 06:50:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097997250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916518288] [2025-03-04 06:50:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:25,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 360 [2025-03-04 06:50:25,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 329 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 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:50:25,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:25,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 360 [2025-03-04 06:50:25,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:36,509 INFO L124 PetriNetUnfolderBase]: 30211/117574 cut-off events. [2025-03-04 06:50:36,509 INFO L125 PetriNetUnfolderBase]: For 19918/20434 co-relation queries the response was YES. [2025-03-04 06:50:36,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184430 conditions, 117574 events. 30211/117574 cut-off events. For 19918/20434 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 1746373 event pairs, 21582 based on Foata normal form. 168/106838 useless extension candidates. Maximal degree in co-relation 178682. Up to 42544 conditions per place. [2025-03-04 06:50:37,271 INFO L140 encePairwiseOnDemand]: 349/360 looper letters, 94 selfloop transitions, 18 changer transitions 0/373 dead transitions. [2025-03-04 06:50:37,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 373 transitions, 1166 flow [2025-03-04 06:50:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-03-04 06:50:37,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046296296296296 [2025-03-04 06:50:37,274 INFO L175 Difference]: Start difference. First operand has 318 places, 329 transitions, 804 flow. Second operand 3 states and 869 transitions. [2025-03-04 06:50:37,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 373 transitions, 1166 flow [2025-03-04 06:50:37,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 373 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:37,318 INFO L231 Difference]: Finished difference. Result has 320 places, 345 transitions, 934 flow [2025-03-04 06:50:37,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=320, PETRI_TRANSITIONS=345} [2025-03-04 06:50:37,320 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, -1 predicate places. [2025-03-04 06:50:37,320 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 345 transitions, 934 flow [2025-03-04 06:50:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 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:50:37,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:37,322 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] [2025-03-04 06:50:37,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:50:37,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:37,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1700965638, now seen corresponding path program 1 times [2025-03-04 06:50:37,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854374783] [2025-03-04 06:50:37,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:37,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:50:37,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:50:37,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:37,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:37,397 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:50:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:37,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854374783] [2025-03-04 06:50:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854374783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:37,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945868151] [2025-03-04 06:50:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:37,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:37,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:37,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 360 [2025-03-04 06:50:37,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 345 transitions, 934 flow. Second operand has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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:50:37,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:37,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 360 [2025-03-04 06:50:37,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:47,170 INFO L124 PetriNetUnfolderBase]: 22266/104075 cut-off events. [2025-03-04 06:50:47,171 INFO L125 PetriNetUnfolderBase]: For 6061/7386 co-relation queries the response was YES. [2025-03-04 06:50:47,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150308 conditions, 104075 events. 22266/104075 cut-off events. For 6061/7386 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 1607733 event pairs, 9511 based on Foata normal form. 77/94641 useless extension candidates. Maximal degree in co-relation 92323. Up to 30401 conditions per place. [2025-03-04 06:50:47,912 INFO L140 encePairwiseOnDemand]: 355/360 looper letters, 108 selfloop transitions, 5 changer transitions 0/407 dead transitions. [2025-03-04 06:50:47,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 407 transitions, 1284 flow [2025-03-04 06:50:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1704 transitions. [2025-03-04 06:50:47,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2025-03-04 06:50:47,915 INFO L175 Difference]: Start difference. First operand has 320 places, 345 transitions, 934 flow. Second operand 6 states and 1704 transitions. [2025-03-04 06:50:47,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 407 transitions, 1284 flow [2025-03-04 06:50:47,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 407 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:47,937 INFO L231 Difference]: Finished difference. Result has 326 places, 347 transitions, 924 flow [2025-03-04 06:50:47,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=326, PETRI_TRANSITIONS=347} [2025-03-04 06:50:47,938 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 5 predicate places. [2025-03-04 06:50:47,938 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 347 transitions, 924 flow [2025-03-04 06:50:47,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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:50:47,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:47,939 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, 1] [2025-03-04 06:50:47,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:50:47,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:50:47,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 784878813, now seen corresponding path program 1 times [2025-03-04 06:50:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:47,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33717514] [2025-03-04 06:50:47,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:47,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:50:47,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:50:47,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,977 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:50:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33717514] [2025-03-04 06:50:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33717514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:47,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815084253] [2025-03-04 06:50:47,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:47,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:47,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:47,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:48,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 360 [2025-03-04 06:50:48,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 347 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:48,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:48,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 360 [2025-03-04 06:50:48,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand