./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:50:35,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:50:35,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:50:35,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:50:35,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:50:35,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:50:35,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:50:35,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:50:35,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:50:35,231 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:50:35,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:50:35,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:50:35,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:50:35,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:50:35,231 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:50:35,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:50:35,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:50:35,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:50:35,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:50:35,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:50:35,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:50:35,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:50:35,234 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:50:35,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d28004f57c6988e792d07d7254dfd532aeffd19f38063d85c3bfa2c0f504914f [2025-03-08 04:50:35,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:50:35,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:50:35,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:50:35,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:50:35,432 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:50:35,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_2.c [2025-03-08 04:50:36,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60be92ed/6afb4c53225d44fcade3519f45cfee93/FLAGab7e026e2 [2025-03-08 04:50:36,735 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:50:36,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c [2025-03-08 04:50:36,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60be92ed/6afb4c53225d44fcade3519f45cfee93/FLAGab7e026e2 [2025-03-08 04:50:36,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60be92ed/6afb4c53225d44fcade3519f45cfee93 [2025-03-08 04:50:36,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:50:36,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:50:36,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:50:36,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:50:36,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:50:36,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36, skipping insertion in model container [2025-03-08 04:50:36,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:50:36,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c[730,743] [2025-03-08 04:50:36,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:50:36,867 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:50:36,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_2.c[730,743] [2025-03-08 04:50:36,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:50:36,886 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:50:36,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36 WrapperNode [2025-03-08 04:50:36,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:50:36,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:50:36,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:50:36,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:50:36,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,906 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2025-03-08 04:50:36,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:50:36,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:50:36,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:50:36,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:50:36,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,921 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:50:36,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:50:36,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:50:36,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:50:36,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:50:36,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (1/1) ... [2025-03-08 04:50:36,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:50:36,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:36,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:50:36,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:50:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:50:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:50:36,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:50:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:50:37,013 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:50:37,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:50:37,085 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 04:50:37,085 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:50:37,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:50:37,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:50:37,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:37 BoogieIcfgContainer [2025-03-08 04:50:37,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:50:37,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:50:37,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:50:37,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:50:37,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:50:36" (1/3) ... [2025-03-08 04:50:37,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45578ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:37, skipping insertion in model container [2025-03-08 04:50:37,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:50:36" (2/3) ... [2025-03-08 04:50:37,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45578ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:50:37, skipping insertion in model container [2025-03-08 04:50:37,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:37" (3/3) ... [2025-03-08 04:50:37,099 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_2.c [2025-03-08 04:50:37,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:50:37,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_2.c that has 1 procedures, 11 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:50:37,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:50:37,156 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c573f4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:50:37,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:50:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 04:50:37,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:37,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 04:50:37,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:37,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 40048873, now seen corresponding path program 1 times [2025-03-08 04:50:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965418556] [2025-03-08 04:50:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:50:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:37,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 04:50:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 04:50:37,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:50:37,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965418556] [2025-03-08 04:50:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965418556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:50:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:50:37,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:50:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37173481] [2025-03-08 04:50:37,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:50:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:50:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:37,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:50:37,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:50:37,322 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:37,339 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-03-08 04:50:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:50:37,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-08 04:50:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:37,344 INFO L225 Difference]: With dead ends: 20 [2025-03-08 04:50:37,344 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 04:50:37,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:50:37,348 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:37,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 04:50:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-08 04:50:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-08 04:50:37,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2025-03-08 04:50:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-08 04:50:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-03-08 04:50:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:50:37,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:37,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:50:37,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:50:37,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash -168596725, now seen corresponding path program 1 times [2025-03-08 04:50:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786560078] [2025-03-08 04:50:37,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:50:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:37,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:50:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:50:37,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:50:37,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786560078] [2025-03-08 04:50:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786560078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:50:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:50:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:50:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426846293] [2025-03-08 04:50:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:50:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:50:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:37,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:50:37,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:50:37,405 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:37,414 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2025-03-08 04:50:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:50:37,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-08 04:50:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:37,414 INFO L225 Difference]: With dead ends: 14 [2025-03-08 04:50:37,414 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 04:50:37,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:50:37,415 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:37,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 04:50:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 04:50:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-08 04:50:37,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2025-03-08 04:50:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:37,417 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-08 04:50:37,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-03-08 04:50:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:50:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:37,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:50:37,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:50:37,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:37,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -930692191, now seen corresponding path program 1 times [2025-03-08 04:50:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710536094] [2025-03-08 04:50:37,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:50:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:50:37,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:50:37,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:50:37,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710536094] [2025-03-08 04:50:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710536094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192625209] [2025-03-08 04:50:37,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:50:37,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:37,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:37,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:50:37,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:50:37,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:50:37,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:50:37,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:50:37,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:50:37,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192625209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:37,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:50:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 04:50:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933724632] [2025-03-08 04:50:37,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:50:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:37,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:50:37,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:50:37,563 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:37,583 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 04:50:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:50:37,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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) Word has length 8 [2025-03-08 04:50:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:37,583 INFO L225 Difference]: With dead ends: 18 [2025-03-08 04:50:37,583 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 04:50:37,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:50:37,584 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:37,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 04:50:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 04:50:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-08 04:50:37,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2025-03-08 04:50:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:37,586 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-08 04:50:37,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-08 04:50:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:50:37,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:37,587 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:50:37,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:50:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:37,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:37,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1404051317, now seen corresponding path program 2 times [2025-03-08 04:50:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448081181] [2025-03-08 04:50:37,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:50:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:37,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 04:50:37,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:50:37,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:50:37,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:50:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448081181] [2025-03-08 04:50:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448081181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769692540] [2025-03-08 04:50:37,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:50:37,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:37,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:50:37,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:50:37,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 04:50:37,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:50:37,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:50:37,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:37,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:50:37,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769692540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:37,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:50:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2025-03-08 04:50:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733165718] [2025-03-08 04:50:37,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:50:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:37,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:50:37,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:50:37,996 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:38,126 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-03-08 04:50:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:50:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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) Word has length 11 [2025-03-08 04:50:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:38,127 INFO L225 Difference]: With dead ends: 38 [2025-03-08 04:50:38,127 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:50:38,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:50:38,128 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:38,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:50:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2025-03-08 04:50:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 04:50:38,134 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2025-03-08 04:50:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 04:50:38,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 04:50:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:50:38,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:38,135 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 04:50:38,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:50:38,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 04:50:38,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -6517843, now seen corresponding path program 3 times [2025-03-08 04:50:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088217178] [2025-03-08 04:50:38,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:50:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:38,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 9 equivalence classes. [2025-03-08 04:50:38,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:50:38,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 04:50:38,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 04:50:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:38,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088217178] [2025-03-08 04:50:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088217178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:38,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133992453] [2025-03-08 04:50:38,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:50:38,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:38,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:38,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:50:38,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:50:38,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 9 equivalence classes. [2025-03-08 04:50:38,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:50:38,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 04:50:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:50:38,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 04:50:38,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 04:50:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133992453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:38,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:50:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 04:50:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676411483] [2025-03-08 04:50:38,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 04:50:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:38,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 04:50:38,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:50:38,565 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:38,590 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-08 04:50:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:50:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) Word has length 21 [2025-03-08 04:50:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:38,591 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:50:38,591 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:50:38,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:50:38,591 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:38,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:50:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 04:50:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-03-08 04:50:38,601 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 21 [2025-03-08 04:50:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:38,602 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-03-08 04:50:38,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-03-08 04:50:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 04:50:38,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:38,604 INFO L218 NwaCegarLoop]: trace histogram [36, 6, 6, 1, 1, 1, 1, 1] [2025-03-08 04:50:38,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:50:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:38,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 366827829, now seen corresponding path program 4 times [2025-03-08 04:50:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999483126] [2025-03-08 04:50:38,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:50:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:38,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 04:50:38,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 52 of 53 statements. [2025-03-08 04:50:38,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:50:38,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 04:50:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999483126] [2025-03-08 04:50:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999483126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843975955] [2025-03-08 04:50:39,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:50:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:39,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:50:39,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:50:39,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 04:50:39,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 52 of 53 statements. [2025-03-08 04:50:39,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:50:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:39,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:50:39,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 04:50:39,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 04:50:39,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843975955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:39,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:50:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2025-03-08 04:50:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797817272] [2025-03-08 04:50:39,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:39,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 04:50:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:39,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 04:50:39,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-03-08 04:50:39,632 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:40,096 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-03-08 04:50:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 04:50:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 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) Word has length 53 [2025-03-08 04:50:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:40,097 INFO L225 Difference]: With dead ends: 54 [2025-03-08 04:50:40,097 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:50:40,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1322, Invalid=2968, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 04:50:40,102 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:40,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:50:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:50:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:50:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:50:40,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-08 04:50:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:40,105 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:50:40,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:50:40,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:50:40,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:50:40,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:50:40,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:40,314 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-03-08 04:50:40,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:50:40,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:50:40,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:50:40 BoogieIcfgContainer [2025-03-08 04:50:40,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:50:40,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:50:40,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:50:40,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:50:40,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:50:37" (3/4) ... [2025-03-08 04:50:40,516 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:50:40,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-08 04:50:40,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:50:40,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:50:40,520 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:50:40,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:50:40,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:50:40,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:50:40,582 INFO L158 Benchmark]: Toolchain (without parser) took 3830.98ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 141.7MB in the end (delta: 17.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2025-03-08 04:50:40,583 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:50:40,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.93ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:50:40,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.65ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:50:40,585 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 146.5MB in the end (delta: 809.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:50:40,585 INFO L158 Benchmark]: IcfgBuilder took 163.67ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 135.8MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:50:40,585 INFO L158 Benchmark]: TraceAbstraction took 3419.75ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 147.0MB in the end (delta: -12.0MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2025-03-08 04:50:40,585 INFO L158 Benchmark]: Witness Printer took 67.86ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 141.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:50:40,588 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.97ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.93ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.65ms. Allocated memory is still 201.3MB. Free memory was 148.5MB in the beginning and 147.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 146.5MB in the end (delta: 809.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 163.67ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 135.8MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3419.75ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 147.0MB in the end (delta: -12.0MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Witness Printer took 67.86ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 141.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: 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 CFG has 1 procedures, 11 locations, 13 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 37 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 198 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 457/2968 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 - InvariantResult [Line: 21]: Location Invariant Derived location invariant: ((a <= 5) && (b <= 6)) - InvariantResult [Line: 20]: Location Invariant Derived location invariant: ((a <= 6) && (6 == b)) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:50:40,602 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE