/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:43,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:43,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:13:43,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:43,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:43,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:43,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:43,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:43,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:43,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:43,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:43,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:43,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:43,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:43,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:43,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:43,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:43,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:43,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:43,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:13:43,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:43,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:43,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:43,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:43,378 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:43,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2025-04-14 00:13:44,649 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b2cc996/b5053fc043fb4c72aeb7b8669bb3820c/FLAG6d24258d7 [2025-04-14 00:13:44,869 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:44,870 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2025-04-14 00:13:44,882 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b2cc996/b5053fc043fb4c72aeb7b8669bb3820c/FLAG6d24258d7 [2025-04-14 00:13:45,699 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b2cc996/b5053fc043fb4c72aeb7b8669bb3820c [2025-04-14 00:13:45,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:45,702 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:45,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:45,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:45,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:45,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:45" (1/1) ... [2025-04-14 00:13:45,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32beb269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:45, skipping insertion in model container [2025-04-14 00:13:45,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:45" (1/1) ... [2025-04-14 00:13:45,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:45,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i[1129,1142] [2025-04-14 00:13:45,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:45,980 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:45,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i[1129,1142] [2025-04-14 00:13:46,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:46,046 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:46,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46 WrapperNode [2025-04-14 00:13:46,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:46,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:46,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:46,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:46,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,080 INFO L138 Inliner]: procedures = 162, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-04-14 00:13:46,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:46,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:46,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:46,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:46,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,094 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-04-14 00:13:46,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:46,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:46,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:46,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:46,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (1/1) ... [2025-04-14 00:13:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:46,129 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-04-14 00:13:46,131 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-04-14 00:13:46,145 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:13:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:46,147 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:13:46,224 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:46,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:46,331 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:46,331 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:46,331 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:46,433 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:46,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:46 BoogieIcfgContainer [2025-04-14 00:13:46,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:46,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:46,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:46,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:46,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:45" (1/3) ... [2025-04-14 00:13:46,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d9091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:46, skipping insertion in model container [2025-04-14 00:13:46,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:46" (2/3) ... [2025-04-14 00:13:46,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d9091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:46, skipping insertion in model container [2025-04-14 00:13:46,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:46" (3/3) ... [2025-04-14 00:13:46,439 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2025-04-14 00:13:46,448 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:46,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i that has 2 procedures, 27 locations, 25 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:13:46,449 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:46,475 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:13:46,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 56 flow [2025-04-14 00:13:46,523 INFO L116 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-04-14 00:13:46,527 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:46,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:13:46,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 56 flow [2025-04-14 00:13:46,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-04-14 00:13:46,540 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:46,547 INFO L340 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;@29701137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:46,547 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 00:13:46,553 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:46,553 INFO L116 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-04-14 00:13:46,553 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:46,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:46,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:46,554 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:46,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -94126679, now seen corresponding path program 1 times [2025-04-14 00:13:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:46,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561377180] [2025-04-14 00:13:46,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:46,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:13:46,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:13:46,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:46,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561377180] [2025-04-14 00:13:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561377180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:46,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389140554] [2025-04-14 00:13:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:46,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:46,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:46,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:46,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:46,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-04-14 00:13:46,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-14 00:13:46,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:46,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-04-14 00:13:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:46,960 INFO L116 PetriNetUnfolderBase]: 44/129 cut-off events. [2025-04-14 00:13:46,960 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:46,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 129 events. 44/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 469 event pairs, 21 based on Foata normal form. 7/135 useless extension candidates. Maximal degree in co-relation 235. Up to 75 conditions per place. [2025-04-14 00:13:46,965 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 17 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2025-04-14 00:13:46,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 105 flow [2025-04-14 00:13:46,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-14 00:13:46,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-04-14 00:13:46,975 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 3 states and 45 transitions. [2025-04-14 00:13:46,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 105 flow [2025-04-14 00:13:46,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:46,980 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 50 flow [2025-04-14 00:13:46,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2025-04-14 00:13:46,985 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-14 00:13:46,985 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 50 flow [2025-04-14 00:13:46,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-14 00:13:46,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:46,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:46,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:46,986 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:46,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:46,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1593349505, now seen corresponding path program 1 times [2025-04-14 00:13:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:46,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526334014] [2025-04-14 00:13:46,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:13:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:13:47,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:47,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526334014] [2025-04-14 00:13:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526334014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203453822] [2025-04-14 00:13:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:47,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:47,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:47,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:47,098 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-04-14 00:13:47,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-14 00:13:47,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:47,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-04-14 00:13:47,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:47,153 INFO L116 PetriNetUnfolderBase]: 15/55 cut-off events. [2025-04-14 00:13:47,154 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:13:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 55 events. 15/55 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 6 based on Foata normal form. 4/58 useless extension candidates. Maximal degree in co-relation 107. Up to 28 conditions per place. [2025-04-14 00:13:47,154 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 14 selfloop transitions, 4 changer transitions 1/24 dead transitions. [2025-04-14 00:13:47,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 98 flow [2025-04-14 00:13:47,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-14 00:13:47,156 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-14 00:13:47,156 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 50 flow. Second operand 3 states and 42 transitions. [2025-04-14 00:13:47,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 98 flow [2025-04-14 00:13:47,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:47,157 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 56 flow [2025-04-14 00:13:47,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2025-04-14 00:13:47,157 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2025-04-14 00:13:47,157 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 56 flow [2025-04-14 00:13:47,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04-14 00:13:47,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:47,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:47,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:13:47,158 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:47,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -741931613, now seen corresponding path program 2 times [2025-04-14 00:13:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:47,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756317132] [2025-04-14 00:13:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:13:47,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:47,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:13:47,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:13:47,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:13:47,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:47,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:47,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756317132] [2025-04-14 00:13:47,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756317132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:47,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950836998] [2025-04-14 00:13:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:47,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:47,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:47,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:47,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-04-14 00:13:47,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04-14 00:13:47,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:47,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-04-14 00:13:47,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:47,390 INFO L116 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-04-14 00:13:47,390 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:13:47,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 36 events. 5/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 8/44 useless extension candidates. Maximal degree in co-relation 71. Up to 21 conditions per place. [2025-04-14 00:13:47,391 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 10 selfloop transitions, 6 changer transitions 2/23 dead transitions. [2025-04-14 00:13:47,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 100 flow [2025-04-14 00:13:47,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-04-14 00:13:47,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2025-04-14 00:13:47,393 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 56 flow. Second operand 4 states and 49 transitions. [2025-04-14 00:13:47,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 100 flow [2025-04-14 00:13:47,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:47,396 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 64 flow [2025-04-14 00:13:47,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2025-04-14 00:13:47,397 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2025-04-14 00:13:47,397 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 64 flow [2025-04-14 00:13:47,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-04-14 00:13:47,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:47,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:47,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:13:47,397 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:13:47,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 985813139, now seen corresponding path program 1 times [2025-04-14 00:13:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:47,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760098879] [2025-04-14 00:13:47,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:47,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:13:47,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:13:47,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:13:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:47,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760098879] [2025-04-14 00:13:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760098879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:47,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885318921] [2025-04-14 00:13:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:47,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:47,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:47,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:47,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2025-04-14 00:13:47,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-04-14 00:13:47,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:47,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2025-04-14 00:13:47,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:47,606 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-14 00:13:47,606 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 00:13:47,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 23 events. 3/23 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 1 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 45. Up to 11 conditions per place. [2025-04-14 00:13:47,606 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-04-14 00:13:47,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 75 flow [2025-04-14 00:13:47,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-14 00:13:47,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2025-04-14 00:13:47,609 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 64 flow. Second operand 4 states and 41 transitions. [2025-04-14 00:13:47,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 75 flow [2025-04-14 00:13:47,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 16 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:47,609 INFO L231 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow [2025-04-14 00:13:47,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0} [2025-04-14 00:13:47,610 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2025-04-14 00:13:47,610 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 0 transitions, 0 flow [2025-04-14 00:13:47,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-04-14 00:13:47,612 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-14 00:13:47,612 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 00:13:47,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:13:47,613 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-14 00:13:47,618 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:13:47,618 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:13:47,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:13:47 BasicIcfg [2025-04-14 00:13:47,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:13:47,623 INFO L158 Benchmark]: Toolchain (without parser) took 1920.84ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 122.4MB in the end (delta: -5.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:47,623 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:47,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.70ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 93.9MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:47,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.34ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:47,623 INFO L158 Benchmark]: Boogie Preprocessor took 23.34ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:47,623 INFO L158 Benchmark]: IcfgBuilder took 328.66ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 61.2MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:13:47,624 INFO L158 Benchmark]: TraceAbstraction took 1187.77ms. Allocated memory is still 167.8MB. Free memory was 60.4MB in the beginning and 122.4MB in the end (delta: -62.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:47,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 343.70ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 93.9MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.34ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.34ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 328.66ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 61.2MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1187.77ms. Allocated memory is still 167.8MB. Free memory was 60.4MB in the beginning and 122.4MB in the end (delta: -62.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 38 locations, 36 edges, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 0 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:13:47,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...