/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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:18:56,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:18:56,591 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:18:56,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:18:56,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:18:56,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:18:56,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:18:56,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:18:56,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:18:56,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:18:56,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:18:56,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:18:56,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:18:56,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:56,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:56,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:56,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:18:56,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:18:56,619 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:18:56,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:18:56,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:18:56,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:18:56,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:18:56,857 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:18:56,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-04-14 00:18:58,111 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a21ce6a/44129ca24f35498eac3d4bb243aa92ee/FLAG81076bf83 [2025-04-14 00:18:58,372 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:18:58,374 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-04-14 00:18:58,387 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a21ce6a/44129ca24f35498eac3d4bb243aa92ee/FLAG81076bf83 [2025-04-14 00:18:59,112 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a21ce6a/44129ca24f35498eac3d4bb243aa92ee [2025-04-14 00:18:59,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:18:59,115 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:18:59,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:59,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:18:59,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:18:59,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4944ae1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59, skipping insertion in model container [2025-04-14 00:18:59,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:18:59,296 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-04-14 00:18:59,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:59,423 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:18:59,445 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2025-04-14 00:18:59,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:59,506 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:18:59,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59 WrapperNode [2025-04-14 00:18:59,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:59,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:59,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:18:59,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:18:59,512 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:18:59" (1/1) ... [2025-04-14 00:18:59,524 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:18:59" (1/1) ... [2025-04-14 00:18:59,548 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 162 [2025-04-14 00:18:59,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:59,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:18:59,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:18:59,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:18:59,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,577 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-14 00:18:59,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:18:59,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:18:59,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:18:59,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:18:59,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (1/1) ... [2025-04-14 00:18:59,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:59,633 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:18:59,637 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:18:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:18:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:18:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:18:59,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:18:59,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:18:59,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:18:59,655 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:18:59,772 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:18:59,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:19:00,000 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:19:00,001 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:19:00,001 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:19:00,262 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:19:00,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:00 BoogieIcfgContainer [2025-04-14 00:19:00,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:19:00,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:19:00,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:19:00,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:19:00,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:18:59" (1/3) ... [2025-04-14 00:19:00,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e3345a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:00, skipping insertion in model container [2025-04-14 00:19:00,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:59" (2/3) ... [2025-04-14 00:19:00,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e3345a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:19:00, skipping insertion in model container [2025-04-14 00:19:00,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:19:00" (3/3) ... [2025-04-14 00:19:00,274 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-04-14 00:19:00,290 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:19:00,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 37 locations, 37 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-14 00:19:00,292 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:19:00,335 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:19:00,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 80 flow [2025-04-14 00:19:00,382 INFO L116 PetriNetUnfolderBase]: 1/37 cut-off events. [2025-04-14 00:19:00,384 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:19:00,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-14 00:19:00,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 38 transitions, 80 flow [2025-04-14 00:19:00,391 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 63 flow [2025-04-14 00:19:00,397 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:19:00,409 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;@8363bc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:19:00,409 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:19:00,415 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:19:00,415 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-14 00:19:00,415 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:19:00,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:00,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:00,417 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:00,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash 936173116, now seen corresponding path program 1 times [2025-04-14 00:19:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:00,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142217074] [2025-04-14 00:19:00,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:00,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:19:00,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:19:00,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:00,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:00,746 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:19:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:00,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142217074] [2025-04-14 00:19:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142217074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:00,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:19:00,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534274103] [2025-04-14 00:19:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:00,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:19:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:00,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:19:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:19:00,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:00,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:00,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:00,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:00,912 INFO L116 PetriNetUnfolderBase]: 113/285 cut-off events. [2025-04-14 00:19:00,912 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:19:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 285 events. 113/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1062 event pairs, 33 based on Foata normal form. 14/274 useless extension candidates. Maximal degree in co-relation 531. Up to 190 conditions per place. [2025-04-14 00:19:00,918 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2025-04-14 00:19:00,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 141 flow [2025-04-14 00:19:00,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:19:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:19:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-14 00:19:00,927 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2025-04-14 00:19:00,928 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 63 flow. Second operand 3 states and 56 transitions. [2025-04-14 00:19:00,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 141 flow [2025-04-14 00:19:00,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:00,934 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 64 flow [2025-04-14 00:19:00,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2025-04-14 00:19:00,939 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-14 00:19:00,939 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 64 flow [2025-04-14 00:19:00,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:19:00,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:00,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:00,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:19:00,939 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:00,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2014214942, now seen corresponding path program 1 times [2025-04-14 00:19:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:00,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463757691] [2025-04-14 00:19:00,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:00,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 00:19:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:19:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:01,159 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:19:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:01,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463757691] [2025-04-14 00:19:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463757691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:01,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:19:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56039154] [2025-04-14 00:19:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:01,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:01,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:01,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:01,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:01,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:19:01,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:01,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:01,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:01,303 INFO L116 PetriNetUnfolderBase]: 91/244 cut-off events. [2025-04-14 00:19:01,304 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-14 00:19:01,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 244 events. 91/244 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 905 event pairs, 45 based on Foata normal form. 14/255 useless extension candidates. Maximal degree in co-relation 478. Up to 147 conditions per place. [2025-04-14 00:19:01,305 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 23 selfloop transitions, 2 changer transitions 16/46 dead transitions. [2025-04-14 00:19:01,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 187 flow [2025-04-14 00:19:01,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:19:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:19:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-14 00:19:01,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2025-04-14 00:19:01,309 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 64 flow. Second operand 5 states and 78 transitions. [2025-04-14 00:19:01,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 187 flow [2025-04-14 00:19:01,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:01,310 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 72 flow [2025-04-14 00:19:01,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-04-14 00:19:01,311 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-04-14 00:19:01,311 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 72 flow [2025-04-14 00:19:01,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:19:01,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:01,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:01,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:19:01,311 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:01,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash -441835875, now seen corresponding path program 1 times [2025-04-14 00:19:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:01,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179395857] [2025-04-14 00:19:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:19:01,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:19:01,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:01,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:01,418 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:19:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:01,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179395857] [2025-04-14 00:19:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179395857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:19:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721061188] [2025-04-14 00:19:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:01,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:19:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:01,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:19:01,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:19:01,419 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:01,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:19:01,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:01,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:01,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:01,486 INFO L116 PetriNetUnfolderBase]: 72/190 cut-off events. [2025-04-14 00:19:01,486 INFO L117 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-04-14 00:19:01,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 190 events. 72/190 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 601 event pairs, 42 based on Foata normal form. 3/192 useless extension candidates. Maximal degree in co-relation 401. Up to 131 conditions per place. [2025-04-14 00:19:01,487 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 26 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-04-14 00:19:01,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 146 flow [2025-04-14 00:19:01,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:19:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:19:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-04-14 00:19:01,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-14 00:19:01,489 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 72 flow. Second operand 3 states and 50 transitions. [2025-04-14 00:19:01,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 146 flow [2025-04-14 00:19:01,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 134 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:19:01,490 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 72 flow [2025-04-14 00:19:01,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2025-04-14 00:19:01,491 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-14 00:19:01,491 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 72 flow [2025-04-14 00:19:01,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:19:01,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:01,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:01,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:19:01,491 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:01,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash 597501759, now seen corresponding path program 1 times [2025-04-14 00:19:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:01,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815182498] [2025-04-14 00:19:01,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:01,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:19:01,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:19:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:01,653 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:19:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:01,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815182498] [2025-04-14 00:19:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815182498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331228163] [2025-04-14 00:19:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:01,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:01,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:01,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:01,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:01,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:19:01,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:01,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:01,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:01,737 INFO L116 PetriNetUnfolderBase]: 56/160 cut-off events. [2025-04-14 00:19:01,737 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 00:19:01,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 160 events. 56/160 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 485 event pairs, 18 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 342. Up to 79 conditions per place. [2025-04-14 00:19:01,738 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 26 selfloop transitions, 7 changer transitions 2/40 dead transitions. [2025-04-14 00:19:01,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 174 flow [2025-04-14 00:19:01,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-14 00:19:01,739 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-04-14 00:19:01,739 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 72 flow. Second operand 4 states and 66 transitions. [2025-04-14 00:19:01,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 174 flow [2025-04-14 00:19:01,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:19:01,740 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 92 flow [2025-04-14 00:19:01,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-04-14 00:19:01,741 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-04-14 00:19:01,741 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 92 flow [2025-04-14 00:19:01,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:19:01,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:01,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:01,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:19:01,741 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:01,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1059372880, now seen corresponding path program 1 times [2025-04-14 00:19:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:01,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870570637] [2025-04-14 00:19:01,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:01,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 00:19:01,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:19:01,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:01,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:01,882 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:19:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:01,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870570637] [2025-04-14 00:19:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870570637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237878369] [2025-04-14 00:19:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:01,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:01,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:01,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:01,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:01,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:19:01,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:01,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:01,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:01,946 INFO L116 PetriNetUnfolderBase]: 54/159 cut-off events. [2025-04-14 00:19:01,946 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-14 00:19:01,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 159 events. 54/159 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 462 event pairs, 26 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 374. Up to 80 conditions per place. [2025-04-14 00:19:01,947 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-04-14 00:19:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 190 flow [2025-04-14 00:19:01,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-14 00:19:01,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40131578947368424 [2025-04-14 00:19:01,950 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 92 flow. Second operand 4 states and 61 transitions. [2025-04-14 00:19:01,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 190 flow [2025-04-14 00:19:01,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:19:01,951 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 112 flow [2025-04-14 00:19:01,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-04-14 00:19:01,951 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-04-14 00:19:01,952 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 112 flow [2025-04-14 00:19:01,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:19:01,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:01,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:01,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:19:01,952 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:01,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1859615445, now seen corresponding path program 1 times [2025-04-14 00:19:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:01,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633743600] [2025-04-14 00:19:01,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:01,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:19:01,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:19:01,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:02,044 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:19:02,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:02,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633743600] [2025-04-14 00:19:02,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633743600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:02,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:02,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:19:02,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853023618] [2025-04-14 00:19:02,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:02,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:19:02,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:02,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:19:02,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:19:02,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:02,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:19:02,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:02,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:02,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:02,094 INFO L116 PetriNetUnfolderBase]: 48/145 cut-off events. [2025-04-14 00:19:02,095 INFO L117 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-04-14 00:19:02,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 145 events. 48/145 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 401 event pairs, 22 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 355. Up to 83 conditions per place. [2025-04-14 00:19:02,096 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 26 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-04-14 00:19:02,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 184 flow [2025-04-14 00:19:02,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:19:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:19:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:19:02,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 00:19:02,100 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 112 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:19:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 184 flow [2025-04-14 00:19:02,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 179 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:19:02,101 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 107 flow [2025-04-14 00:19:02,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-04-14 00:19:02,102 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-04-14 00:19:02,102 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 107 flow [2025-04-14 00:19:02,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:19:02,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:19:02,102 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] [2025-04-14 00:19:02,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:19:02,102 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:19:02,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:19:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash 45496910, now seen corresponding path program 1 times [2025-04-14 00:19:02,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:19:02,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619417892] [2025-04-14 00:19:02,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:19:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:19:02,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:19:02,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:19:02,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:19:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:19:02,213 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:19:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:19:02,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619417892] [2025-04-14 00:19:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619417892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:19:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:19:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:19:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600069544] [2025-04-14 00:19:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:19:02,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:19:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:19:02,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:19:02,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:19:02,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-04-14 00:19:02,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:19:02,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:19:02,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-04-14 00:19:02,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:19:02,298 INFO L116 PetriNetUnfolderBase]: 42/130 cut-off events. [2025-04-14 00:19:02,298 INFO L117 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-04-14 00:19:02,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 130 events. 42/130 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 336 event pairs, 13 based on Foata normal form. 9/138 useless extension candidates. Maximal degree in co-relation 328. Up to 39 conditions per place. [2025-04-14 00:19:02,298 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 0 selfloop transitions, 0 changer transitions 41/41 dead transitions. [2025-04-14 00:19:02,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 228 flow [2025-04-14 00:19:02,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:19:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:19:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2025-04-14 00:19:02,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31954887218045114 [2025-04-14 00:19:02,299 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 107 flow. Second operand 7 states and 85 transitions. [2025-04-14 00:19:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 228 flow [2025-04-14 00:19:02,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:19:02,301 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2025-04-14 00:19:02,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2025-04-14 00:19:02,301 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-04-14 00:19:02,301 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2025-04-14 00:19:02,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:19:02,303 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-14 00:19:02,304 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-14 00:19:02,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:19:02,304 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:19:02,307 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:19:02,308 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:19:02,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:19:02 BasicIcfg [2025-04-14 00:19:02,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:19:02,311 INFO L158 Benchmark]: Toolchain (without parser) took 3196.85ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 63.5MB in the end (delta: 43.3MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.11ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 82.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: Boogie Preprocessor took 48.15ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: IcfgBuilder took 665.27ms. Allocated memory is still 155.2MB. Free memory was 78.4MB in the beginning and 91.8MB in the end (delta: -13.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-14 00:19:02,312 INFO L158 Benchmark]: TraceAbstraction took 2046.56ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 63.5MB in the end (delta: 27.5MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2025-04-14 00:19:02,313 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.18ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 392.11ms. Allocated memory is still 155.2MB. Free memory was 106.1MB in the beginning and 82.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 48.15ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 665.27ms. Allocated memory is still 155.2MB. Free memory was 78.4MB in the beginning and 91.8MB in the end (delta: -13.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2046.56ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 63.5MB in the end (delta: 27.5MB). Peak memory consumption was 28.5MB. 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 - 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 - 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, 55 locations, 56 edges, 7 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.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 0 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=5, InterpolantAutomatonStates: 30, 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.9s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:19:02,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...