./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_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_70-funloop_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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:37,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:37,464 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:37,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:37,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:37,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:37,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:37,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:37,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:37,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:37,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:37,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:37,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:37,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:37,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:37,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:37,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:37,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:37,503 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-04 06:50:37,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:37,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:37,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:37,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:37,744 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:37,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-04 06:50:38,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2996dc89/d1a17cd800e74b47bbe3939f27e21af6/FLAG2271c5a51 [2025-03-04 06:50:39,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:39,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-04 06:50:39,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2996dc89/d1a17cd800e74b47bbe3939f27e21af6/FLAG2271c5a51 [2025-03-04 06:50:39,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2996dc89/d1a17cd800e74b47bbe3939f27e21af6 [2025-03-04 06:50:39,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:39,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:39,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:39,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:39,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:39,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:39" (1/1) ... [2025-03-04 06:50:39,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613c50d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:39, skipping insertion in model container [2025-03-04 06:50:39,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:39" (1/1) ... [2025-03-04 06:50:39,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:39,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:39,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:39,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:39,916 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:39,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:39 WrapperNode [2025-03-04 06:50:39,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:39,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:39,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:39,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:39,922 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:39" (1/1) ... [2025-03-04 06:50:39,932 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:39" (1/1) ... [2025-03-04 06:50:39,957 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 325 [2025-03-04 06:50:39,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:39,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:39,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:39,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:39,962 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:39" (1/1) ... [2025-03-04 06:50:39,963 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:39" (1/1) ... [2025-03-04 06:50:39,967 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:39" (1/1) ... [2025-03-04 06:50:39,967 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:39" (1/1) ... [2025-03-04 06:50:39,976 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:39" (1/1) ... [2025-03-04 06:50:39,978 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:39" (1/1) ... [2025-03-04 06:50:39,981 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:39" (1/1) ... [2025-03-04 06:50:39,982 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:39" (1/1) ... [2025-03-04 06:50:39,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:39,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:39,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:39,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:39,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:39" (1/1) ... [2025-03-04 06:50:39,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:40,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:40,013 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:40,016 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:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:40,033 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:40,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:40,034 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:40,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:40,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:40,486 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:40,488 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-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:40,586 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:40,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:40,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:40,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:40,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:40 BoogieIcfgContainer [2025-03-04 06:50:40,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:40,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:40,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:40,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:40,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:39" (1/3) ... [2025-03-04 06:50:40,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eacc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:40, skipping insertion in model container [2025-03-04 06:50:40,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:39" (2/3) ... [2025-03-04 06:50:40,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eacc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:40, skipping insertion in model container [2025-03-04 06:50:40,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:40" (3/3) ... [2025-03-04 06:50:40,643 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-04 06:50:40,656 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:40,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 315 locations, 1 initial locations, 13 loop locations, and 12 error locations. [2025-03-04 06:50:40,659 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:40,718 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:40,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 345 transitions, 697 flow [2025-03-04 06:50:40,856 INFO L124 PetriNetUnfolderBase]: 44/482 cut-off events. [2025-03-04 06:50:40,859 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:40,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 482 events. 44/482 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1867 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 251. Up to 8 conditions per place. [2025-03-04 06:50:40,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 345 transitions, 697 flow [2025-03-04 06:50:40,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 345 transitions, 697 flow [2025-03-04 06:50:40,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:40,904 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;@96a8d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:40,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:50:40,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:40,923 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-04 06:50:40,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:40,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:40,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1414722519, now seen corresponding path program 1 times [2025-03-04 06:50:40,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:40,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332846293] [2025-03-04 06:50:40,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:41,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:41,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:41,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:41,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:41,284 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:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332846293] [2025-03-04 06:50:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332846293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:41,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754158553] [2025-03-04 06:50:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:41,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:41,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 345 [2025-03-04 06:50:41,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 345 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 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:41,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:41,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 345 [2025-03-04 06:50:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:41,569 INFO L124 PetriNetUnfolderBase]: 98/1371 cut-off events. [2025-03-04 06:50:41,570 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-04 06:50:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 1371 events. 98/1371 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8933 event pairs, 72 based on Foata normal form. 159/1415 useless extension candidates. Maximal degree in co-relation 1320. Up to 187 conditions per place. [2025-03-04 06:50:41,580 INFO L140 encePairwiseOnDemand]: 318/345 looper letters, 23 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-04 06:50:41,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 318 transitions, 693 flow [2025-03-04 06:50:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-03-04 06:50:41,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2025-03-04 06:50:41,600 INFO L175 Difference]: Start difference. First operand has 318 places, 345 transitions, 697 flow. Second operand 3 states and 935 transitions. [2025-03-04 06:50:41,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 318 transitions, 693 flow [2025-03-04 06:50:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 693 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:41,611 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 653 flow [2025-03-04 06:50:41,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-04 06:50:41,616 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, -1 predicate places. [2025-03-04 06:50:41,617 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 653 flow [2025-03-04 06:50:41,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 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:41,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:41,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:41,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1009974240, now seen corresponding path program 1 times [2025-03-04 06:50:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:41,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297337456] [2025-03-04 06:50:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:41,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:41,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:41,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:41,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297337456] [2025-03-04 06:50:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297337456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:41,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795790281] [2025-03-04 06:50:41,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:41,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:41,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:41,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:50:41,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:41,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:41,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:41,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:41,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:42,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795790281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:42,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394066520] [2025-03-04 06:50:42,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:42,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:42,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:42,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:42,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-04 06:50:42,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 653 flow. Second operand has 10 states, 10 states have (on average 293.8) internal successors, (2938), 10 states have internal predecessors, (2938), 0 states have call successors, (0), 0 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:42,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:42,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-04 06:50:42,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:42,336 INFO L124 PetriNetUnfolderBase]: 98/1378 cut-off events. [2025-03-04 06:50:42,336 INFO L125 PetriNetUnfolderBase]: For 5/8 co-relation queries the response was YES. [2025-03-04 06:50:42,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1378 events. 98/1378 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8936 event pairs, 72 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 1495. Up to 187 conditions per place. [2025-03-04 06:50:42,344 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 27 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2025-03-04 06:50:42,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 743 flow [2025-03-04 06:50:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:50:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:50:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2666 transitions. [2025-03-04 06:50:42,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586151368760064 [2025-03-04 06:50:42,354 INFO L175 Difference]: Start difference. First operand has 317 places, 318 transitions, 653 flow. Second operand 9 states and 2666 transitions. [2025-03-04 06:50:42,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 326 transitions, 743 flow [2025-03-04 06:50:42,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:42,361 INFO L231 Difference]: Finished difference. Result has 327 places, 324 transitions, 701 flow [2025-03-04 06:50:42,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=327, PETRI_TRANSITIONS=324} [2025-03-04 06:50:42,362 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 9 predicate places. [2025-03-04 06:50:42,362 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 324 transitions, 701 flow [2025-03-04 06:50:42,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 293.8) internal successors, (2938), 10 states have internal predecessors, (2938), 0 states have call successors, (0), 0 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:42,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:42,365 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:50:42,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:42,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1510720128, now seen corresponding path program 2 times [2025-03-04 06:50:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603826086] [2025-03-04 06:50:42,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:42,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:50:42,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:50:42,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:50:42,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603826086] [2025-03-04 06:50:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603826086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:43,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:43,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294164765] [2025-03-04 06:50:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:43,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:43,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:43,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 345 [2025-03-04 06:50:43,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 324 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 345 [2025-03-04 06:50:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:44,178 INFO L124 PetriNetUnfolderBase]: 1447/5905 cut-off events. [2025-03-04 06:50:44,179 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:50:44,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8800 conditions, 5905 events. 1447/5905 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 54160 event pairs, 1036 based on Foata normal form. 0/5386 useless extension candidates. Maximal degree in co-relation 8676. Up to 2633 conditions per place. [2025-03-04 06:50:44,203 INFO L140 encePairwiseOnDemand]: 318/345 looper letters, 107 selfloop transitions, 86 changer transitions 0/441 dead transitions. [2025-03-04 06:50:44,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 441 transitions, 1321 flow [2025-03-04 06:50:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1652 transitions. [2025-03-04 06:50:44,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7980676328502415 [2025-03-04 06:50:44,206 INFO L175 Difference]: Start difference. First operand has 327 places, 324 transitions, 701 flow. Second operand 6 states and 1652 transitions. [2025-03-04 06:50:44,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 441 transitions, 1321 flow [2025-03-04 06:50:44,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 441 transitions, 1315 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:44,215 INFO L231 Difference]: Finished difference. Result has 336 places, 409 transitions, 1261 flow [2025-03-04 06:50:44,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1261, PETRI_PLACES=336, PETRI_TRANSITIONS=409} [2025-03-04 06:50:44,217 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 18 predicate places. [2025-03-04 06:50:44,217 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 409 transitions, 1261 flow [2025-03-04 06:50:44,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:44,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:44,218 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:44,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 426240535, now seen corresponding path program 1 times [2025-03-04 06:50:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074254300] [2025-03-04 06:50:44,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:44,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:50:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:50:44,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:44,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:44,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074254300] [2025-03-04 06:50:44,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074254300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:44,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314094277] [2025-03-04 06:50:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:44,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:44,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:44,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:44,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 345 [2025-03-04 06:50:44,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 409 transitions, 1261 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 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:44,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:44,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 345 [2025-03-04 06:50:44,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:44,558 INFO L124 PetriNetUnfolderBase]: 322/2280 cut-off events. [2025-03-04 06:50:44,559 INFO L125 PetriNetUnfolderBase]: For 156/170 co-relation queries the response was YES. [2025-03-04 06:50:44,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 2280 events. 322/2280 cut-off events. For 156/170 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17813 event pairs, 55 based on Foata normal form. 1/2098 useless extension candidates. Maximal degree in co-relation 3162. Up to 266 conditions per place. [2025-03-04 06:50:44,569 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 30 selfloop transitions, 3 changer transitions 0/417 dead transitions. [2025-03-04 06:50:44,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 417 transitions, 1343 flow [2025-03-04 06:50:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-03-04 06:50:44,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8869565217391304 [2025-03-04 06:50:44,571 INFO L175 Difference]: Start difference. First operand has 336 places, 409 transitions, 1261 flow. Second operand 3 states and 918 transitions. [2025-03-04 06:50:44,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 417 transitions, 1343 flow [2025-03-04 06:50:44,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 417 transitions, 1343 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:44,582 INFO L231 Difference]: Finished difference. Result has 339 places, 409 transitions, 1272 flow [2025-03-04 06:50:44,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=339, PETRI_TRANSITIONS=409} [2025-03-04 06:50:44,584 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 21 predicate places. [2025-03-04 06:50:44,584 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 409 transitions, 1272 flow [2025-03-04 06:50:44,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 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:44,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:44,585 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:44,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1576673986, now seen corresponding path program 1 times [2025-03-04 06:50:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895030831] [2025-03-04 06:50:44,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:44,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:44,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895030831] [2025-03-04 06:50:44,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895030831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131109085] [2025-03-04 06:50:44,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:44,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:44,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:50:44,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:50:44,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131109085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:44,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:50:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307987253] [2025-03-04 06:50:44,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:44,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:50:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:44,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:50:44,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:50:44,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-04 06:50:45,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 409 transitions, 1272 flow. Second operand has 18 states, 18 states have (on average 293.94444444444446) internal successors, (5291), 18 states have internal predecessors, (5291), 0 states have call successors, (0), 0 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:45,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:45,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-04 06:50:45,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:45,502 INFO L124 PetriNetUnfolderBase]: 273/2183 cut-off events. [2025-03-04 06:50:45,502 INFO L125 PetriNetUnfolderBase]: For 168/209 co-relation queries the response was YES. [2025-03-04 06:50:45,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 2183 events. 273/2183 cut-off events. For 168/209 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17092 event pairs, 72 based on Foata normal form. 4/2026 useless extension candidates. Maximal degree in co-relation 3140. Up to 436 conditions per place. [2025-03-04 06:50:45,515 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 31 selfloop transitions, 21 changer transitions 0/427 dead transitions. [2025-03-04 06:50:45,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 427 transitions, 1464 flow [2025-03-04 06:50:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:50:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:50:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6188 transitions. [2025-03-04 06:50:45,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541062801932368 [2025-03-04 06:50:45,526 INFO L175 Difference]: Start difference. First operand has 339 places, 409 transitions, 1272 flow. Second operand 21 states and 6188 transitions. [2025-03-04 06:50:45,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 427 transitions, 1464 flow [2025-03-04 06:50:45,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 427 transitions, 1458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:45,535 INFO L231 Difference]: Finished difference. Result has 362 places, 422 transitions, 1396 flow [2025-03-04 06:50:45,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1396, PETRI_PLACES=362, PETRI_TRANSITIONS=422} [2025-03-04 06:50:45,538 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 44 predicate places. [2025-03-04 06:50:45,539 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 422 transitions, 1396 flow [2025-03-04 06:50:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 293.94444444444446) internal successors, (5291), 18 states have internal predecessors, (5291), 0 states have call successors, (0), 0 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:45,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:45,541 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:50:45,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:45,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:45,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2067396098, now seen corresponding path program 2 times [2025-03-04 06:50:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112878214] [2025-03-04 06:50:45,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:45,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:45,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:45,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:45,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:46,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112878214] [2025-03-04 06:50:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112878214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278188987] [2025-03-04 06:50:46,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:46,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:46,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:46,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:46,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:50:46,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:46,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:46,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:46,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:46,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:50:46,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:46,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278188987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:46,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:50:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810991523] [2025-03-04 06:50:46,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:46,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:50:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:46,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:50:46,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:50:46,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-04 06:50:46,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 422 transitions, 1396 flow. Second operand has 23 states, 23 states have (on average 294.04347826086956) internal successors, (6763), 23 states have internal predecessors, (6763), 0 states have call successors, (0), 0 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:46,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:46,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-04 06:50:46,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:46,903 INFO L124 PetriNetUnfolderBase]: 273/2198 cut-off events. [2025-03-04 06:50:46,904 INFO L125 PetriNetUnfolderBase]: For 269/310 co-relation queries the response was YES. [2025-03-04 06:50:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 2198 events. 273/2198 cut-off events. For 269/310 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17068 event pairs, 72 based on Foata normal form. 3/2040 useless extension candidates. Maximal degree in co-relation 3140. Up to 436 conditions per place. [2025-03-04 06:50:46,915 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 34 selfloop transitions, 30 changer transitions 0/439 dead transitions. [2025-03-04 06:50:46,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 439 transitions, 1652 flow [2025-03-04 06:50:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:50:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:50:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8827 transitions. [2025-03-04 06:50:46,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528502415458937 [2025-03-04 06:50:46,929 INFO L175 Difference]: Start difference. First operand has 362 places, 422 transitions, 1396 flow. Second operand 30 states and 8827 transitions. [2025-03-04 06:50:46,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 439 transitions, 1652 flow [2025-03-04 06:50:46,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 439 transitions, 1622 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-04 06:50:46,939 INFO L231 Difference]: Finished difference. Result has 389 places, 432 transitions, 1524 flow [2025-03-04 06:50:46,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1524, PETRI_PLACES=389, PETRI_TRANSITIONS=432} [2025-03-04 06:50:46,941 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 71 predicate places. [2025-03-04 06:50:46,942 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 432 transitions, 1524 flow [2025-03-04 06:50:46,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 294.04347826086956) internal successors, (6763), 23 states have internal predecessors, (6763), 0 states have call successors, (0), 0 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:46,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:46,944 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:50:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:47,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-04 06:50:47,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 733603947, now seen corresponding path program 3 times [2025-03-04 06:50:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590907486] [2025-03-04 06:50:47,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:50:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:47,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-04 06:50:47,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:47,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 06:50:47,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:47,231 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:47,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:50:47,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:47,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:47,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:47,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:50:47,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:50:47,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:50:47,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:50:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:50:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:47,292 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-04 06:50:47,293 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:47,295 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:47,325 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:47,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 418 places, 458 transitions, 932 flow [2025-03-04 06:50:47,413 INFO L124 PetriNetUnfolderBase]: 74/759 cut-off events. [2025-03-04 06:50:47,413 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:47,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 759 events. 74/759 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3719 event pairs, 0 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 484. Up to 12 conditions per place. [2025-03-04 06:50:47,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 418 places, 458 transitions, 932 flow [2025-03-04 06:50:47,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 458 transitions, 932 flow [2025-03-04 06:50:47,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:47,424 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;@96a8d06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:47,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:47,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:47,429 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-04 06:50:47,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:47,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:47,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1780855775, now seen corresponding path program 1 times [2025-03-04 06:50:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785855371] [2025-03-04 06:50:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:47,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:47,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:47,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785855371] [2025-03-04 06:50:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785855371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110398189] [2025-03-04 06:50:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:47,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 458 [2025-03-04 06:50:47,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 458 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:47,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 458 [2025-03-04 06:50:47,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:49,069 INFO L124 PetriNetUnfolderBase]: 1782/12784 cut-off events. [2025-03-04 06:50:49,069 INFO L125 PetriNetUnfolderBase]: For 125/135 co-relation queries the response was YES. [2025-03-04 06:50:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15448 conditions, 12784 events. 1782/12784 cut-off events. For 125/135 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 155540 event pairs, 1464 based on Foata normal form. 2247/13949 useless extension candidates. Maximal degree in co-relation 13708. Up to 2601 conditions per place. [2025-03-04 06:50:49,160 INFO L140 encePairwiseOnDemand]: 419/458 looper letters, 33 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-03-04 06:50:49,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 417 transitions, 920 flow [2025-03-04 06:50:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1227 transitions. [2025-03-04 06:50:49,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8930131004366813 [2025-03-04 06:50:49,163 INFO L175 Difference]: Start difference. First operand has 418 places, 458 transitions, 932 flow. Second operand 3 states and 1227 transitions. [2025-03-04 06:50:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 417 transitions, 920 flow [2025-03-04 06:50:49,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:49,172 INFO L231 Difference]: Finished difference. Result has 415 places, 417 transitions, 860 flow [2025-03-04 06:50:49,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=415, PETRI_TRANSITIONS=417} [2025-03-04 06:50:49,173 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, -3 predicate places. [2025-03-04 06:50:49,174 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 417 transitions, 860 flow [2025-03-04 06:50:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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:49,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:49,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:49,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 561019232, now seen corresponding path program 1 times [2025-03-04 06:50:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551361799] [2025-03-04 06:50:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:49,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:49,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:49,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:49,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551361799] [2025-03-04 06:50:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551361799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230855015] [2025-03-04 06:50:49,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:49,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:49,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:49,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:49,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:50:49,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:49,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:49,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:49,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:49,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230855015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:49,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345899895] [2025-03-04 06:50:49,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:49,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:49,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:49,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:49,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 458 [2025-03-04 06:50:49,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 417 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 383.8) internal successors, (3838), 10 states have internal predecessors, (3838), 0 states have call successors, (0), 0 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:49,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:49,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 458 [2025-03-04 06:50:49,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:50,914 INFO L124 PetriNetUnfolderBase]: 1782/12791 cut-off events. [2025-03-04 06:50:50,914 INFO L125 PetriNetUnfolderBase]: For 124/134 co-relation queries the response was YES. [2025-03-04 06:50:50,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15474 conditions, 12791 events. 1782/12791 cut-off events. For 124/134 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 155472 event pairs, 1464 based on Foata normal form. 2/11711 useless extension candidates. Maximal degree in co-relation 15378. Up to 2601 conditions per place. [2025-03-04 06:50:50,999 INFO L140 encePairwiseOnDemand]: 452/458 looper letters, 37 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-03-04 06:50:50,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 425 transitions, 970 flow [2025-03-04 06:50:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:50:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:50:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3486 transitions. [2025-03-04 06:50:51,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457059679767104 [2025-03-04 06:50:51,006 INFO L175 Difference]: Start difference. First operand has 415 places, 417 transitions, 860 flow. Second operand 9 states and 3486 transitions. [2025-03-04 06:50:51,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 425 transitions, 970 flow [2025-03-04 06:50:51,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 425 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:51,013 INFO L231 Difference]: Finished difference. Result has 425 places, 423 transitions, 908 flow [2025-03-04 06:50:51,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=425, PETRI_TRANSITIONS=423} [2025-03-04 06:50:51,014 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, 7 predicate places. [2025-03-04 06:50:51,014 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 423 transitions, 908 flow [2025-03-04 06:50:51,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 383.8) internal successors, (3838), 10 states have internal predecessors, (3838), 0 states have call successors, (0), 0 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:51,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:51,015 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:50:51,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:51,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:51,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:51,217 INFO L85 PathProgramCache]: Analyzing trace with hash -117856768, now seen corresponding path program 2 times [2025-03-04 06:50:51,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:51,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821313690] [2025-03-04 06:50:51,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:51,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:50:51,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:50:51,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:50:51,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821313690] [2025-03-04 06:50:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821313690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:51,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789631166] [2025-03-04 06:50:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:51,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:51,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:51,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 458 [2025-03-04 06:50:51,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 423 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:51,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:51,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 458 [2025-03-04 06:50:51,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:13,429 INFO L124 PetriNetUnfolderBase]: 86364/210876 cut-off events. [2025-03-04 06:51:13,429 INFO L125 PetriNetUnfolderBase]: For 1319/1319 co-relation queries the response was YES. [2025-03-04 06:51:14,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339495 conditions, 210876 events. 86364/210876 cut-off events. For 1319/1319 co-relation queries the response was YES. Maximal size of possible extension queue 4080. Compared 2857919 event pairs, 59516 based on Foata normal form. 0/196037 useless extension candidates. Maximal degree in co-relation 339370. Up to 120095 conditions per place. [2025-03-04 06:51:15,008 INFO L140 encePairwiseOnDemand]: 411/458 looper letters, 170 selfloop transitions, 166 changer transitions 0/653 dead transitions. [2025-03-04 06:51:15,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 653 transitions, 2045 flow [2025-03-04 06:51:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:51:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:51:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2215 transitions. [2025-03-04 06:51:15,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8060407569141194 [2025-03-04 06:51:15,014 INFO L175 Difference]: Start difference. First operand has 425 places, 423 transitions, 908 flow. Second operand 6 states and 2215 transitions. [2025-03-04 06:51:15,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 653 transitions, 2045 flow [2025-03-04 06:51:15,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 653 transitions, 2039 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:51:15,031 INFO L231 Difference]: Finished difference. Result has 434 places, 588 transitions, 1988 flow [2025-03-04 06:51:15,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1988, PETRI_PLACES=434, PETRI_TRANSITIONS=588} [2025-03-04 06:51:15,033 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, 16 predicate places. [2025-03-04 06:51:15,033 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 588 transitions, 1988 flow [2025-03-04 06:51:15,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:51:15,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:15,035 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:15,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:51:15,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:51:15,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1268046121, now seen corresponding path program 1 times [2025-03-04 06:51:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:15,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501600163] [2025-03-04 06:51:15,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:15,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:51:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:51:15,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:51:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501600163] [2025-03-04 06:51:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501600163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:15,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:51:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878763095] [2025-03-04 06:51:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:51:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:15,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:51:15,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:51:15,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 458 [2025-03-04 06:51:15,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 588 transitions, 1988 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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:51:15,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:15,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 458 [2025-03-04 06:51:15,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:51:25,135 INFO L124 PetriNetUnfolderBase]: 19990/85820 cut-off events. [2025-03-04 06:51:25,135 INFO L125 PetriNetUnfolderBase]: For 6733/7267 co-relation queries the response was YES. [2025-03-04 06:51:25,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129829 conditions, 85820 events. 19990/85820 cut-off events. For 6733/7267 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 1247949 event pairs, 10427 based on Foata normal form. 1/77631 useless extension candidates. Maximal degree in co-relation 129702. Up to 18949 conditions per place. [2025-03-04 06:51:25,922 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 42 selfloop transitions, 3 changer transitions 0/598 dead transitions. [2025-03-04 06:51:25,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 598 transitions, 2104 flow [2025-03-04 06:51:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:51:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:51:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2025-03-04 06:51:25,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8726346433770015 [2025-03-04 06:51:25,924 INFO L175 Difference]: Start difference. First operand has 434 places, 588 transitions, 1988 flow. Second operand 3 states and 1199 transitions. [2025-03-04 06:51:25,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 598 transitions, 2104 flow [2025-03-04 06:51:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 598 transitions, 2104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:51:26,039 INFO L231 Difference]: Finished difference. Result has 437 places, 590 transitions, 2013 flow [2025-03-04 06:51:26,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2013, PETRI_PLACES=437, PETRI_TRANSITIONS=590} [2025-03-04 06:51:26,041 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, 19 predicate places. [2025-03-04 06:51:26,041 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 590 transitions, 2013 flow [2025-03-04 06:51:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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:51:26,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:51:26,041 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:51:26,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:51:26,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:51:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1839220439, now seen corresponding path program 1 times [2025-03-04 06:51:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:51:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530326676] [2025-03-04 06:51:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:51:26,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:51:26,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 06:51:26,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 06:51:26,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:51:26,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:51:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:51:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:51:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530326676] [2025-03-04 06:51:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530326676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:51:26,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:51:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:51:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943802660] [2025-03-04 06:51:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:51:26,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:51:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:51:26,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:51:26,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:51:26,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 458 [2025-03-04 06:51:26,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 590 transitions, 2013 flow. Second operand has 5 states, 5 states have (on average 384.6) internal successors, (1923), 5 states have internal predecessors, (1923), 0 states have call successors, (0), 0 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:51:26,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:51:26,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 458 [2025-03-04 06:51:26,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand