./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:58:35,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:58:35,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:58:35,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:58:35,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:58:35,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:58:35,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:58:35,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:58:35,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:58:35,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:58:35,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:58:35,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:58:35,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:58:35,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:58:35,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:58:35,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:58:35,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:58:35,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:35,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:58:35,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:58:35,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:58:35,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:58:35,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:58:35,343 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-jdk21/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 -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2025-02-05 15:58:35,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:58:35,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:58:35,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:58:35,586 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:58:35,586 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:58:35,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-02-05 15:58:36,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83ad962bd/7d002c0c734541d58f79938e76092684/FLAGa3c62e39c [2025-02-05 15:58:37,082 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:58:37,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-02-05 15:58:37,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83ad962bd/7d002c0c734541d58f79938e76092684/FLAGa3c62e39c [2025-02-05 15:58:37,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83ad962bd/7d002c0c734541d58f79938e76092684 [2025-02-05 15:58:37,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:58:37,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:58:37,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:37,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:58:37,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:58:37,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d00dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37, skipping insertion in model container [2025-02-05 15:58:37,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:58:37,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2025-02-05 15:58:37,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:37,251 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:58:37,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2025-02-05 15:58:37,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:58:37,273 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:58:37,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37 WrapperNode [2025-02-05 15:58:37,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:58:37,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:37,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:58:37,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:58:37,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,297 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-02-05 15:58:37,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:58:37,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:58:37,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:58:37,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:58:37,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,312 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-02-05 15:58:37,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:58:37,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:58:37,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:58:37,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:58:37,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (1/1) ... [2025-02-05 15:58:37,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:58:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:37,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:58:37,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:58:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:58:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:58:37,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:58:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:58:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-02-05 15:58:37,372 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-02-05 15:58:37,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:58:37,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:58:37,493 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-02-05 15:58:37,501 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-05 15:58:37,501 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:58:37,508 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:58:37,510 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:58:37,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:37 BoogieIcfgContainer [2025-02-05 15:58:37,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:58:37,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:58:37,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:58:37,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:58:37,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:58:37" (1/3) ... [2025-02-05 15:58:37,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263311c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:37, skipping insertion in model container [2025-02-05 15:58:37,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:58:37" (2/3) ... [2025-02-05 15:58:37,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263311c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:58:37, skipping insertion in model container [2025-02-05 15:58:37,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:37" (3/3) ... [2025-02-05 15:58:37,517 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2025-02-05 15:58:37,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:58:37,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_7-2.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 15:58:37,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:58:37,576 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;@1e0c9d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:58:37,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:58:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:58:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:58:37,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:37,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:37,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:37,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-02-05 15:58:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461901810] [2025-02-05 15:58:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:37,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:58:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:58:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:58:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461901810] [2025-02-05 15:58:37,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461901810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:37,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:37,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175907145] [2025-02-05 15:58:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:37,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:37,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:37,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:37,758 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:58:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:37,784 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-02-05 15:58:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-02-05 15:58:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:37,789 INFO L225 Difference]: With dead ends: 30 [2025-02-05 15:58:37,789 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 15:58:37,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:37,793 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:37,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 15:58:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-05 15:58:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:58:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-05 15:58:37,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-02-05 15:58:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:37,815 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-05 15:58:37,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:58:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-05 15:58:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 15:58:37,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:37,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:37,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:58:37,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:37,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-02-05 15:58:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:37,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581441560] [2025-02-05 15:58:37,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:37,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 15:58:37,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 15:58:37,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:58:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:37,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581441560] [2025-02-05 15:58:37,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581441560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:58:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:58:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:58:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858100166] [2025-02-05 15:58:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:58:37,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:58:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:37,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:58:37,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:37,891 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:58:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:37,907 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-02-05 15:58:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:58:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-05 15:58:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:37,909 INFO L225 Difference]: With dead ends: 24 [2025-02-05 15:58:37,909 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 15:58:37,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:58:37,910 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:37,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 15:58:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-05 15:58:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:58:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-05 15:58:37,917 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-02-05 15:58:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-05 15:58:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:58:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-05 15:58:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:58:37,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:37,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:58:37,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-02-05 15:58:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536851950] [2025-02-05 15:58:37,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:37,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:37,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:37,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:58:38,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536851950] [2025-02-05 15:58:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536851950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:38,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160868264] [2025-02-05 15:58:38,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:38,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:38,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:38,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:38,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:58:38,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:58:38,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:58:38,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:38,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:38,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:58:38,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:58:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160868264] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:38,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-02-05 15:58:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646163079] [2025-02-05 15:58:38,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:38,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:58:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:38,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:58:38,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:58:38,314 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:58:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:38,376 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-02-05 15:58:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:58:38,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-02-05 15:58:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:38,378 INFO L225 Difference]: With dead ends: 35 [2025-02-05 15:58:38,378 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 15:58:38,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:58:38,379 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:38,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 15:58:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 15:58:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 15:58:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-05 15:58:38,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-02-05 15:58:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:38,383 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-05 15:58:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:58:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-05 15:58:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:58:38,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:38,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:38,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:38,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:38,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:38,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-02-05 15:58:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171159758] [2025-02-05 15:58:38,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:38,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:38,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:38,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:58:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171159758] [2025-02-05 15:58:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171159758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609353330] [2025-02-05 15:58:38,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:58:38,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:38,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:38,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:58:38,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:58:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:58:38,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:38,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:38,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:58:38,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:58:38,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:58:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609353330] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:38,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-02-05 15:58:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533674827] [2025-02-05 15:58:38,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:58:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:38,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:58:38,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:58:38,855 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:58:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:38,930 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-02-05 15:58:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:58:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-02-05 15:58:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:38,931 INFO L225 Difference]: With dead ends: 29 [2025-02-05 15:58:38,932 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 15:58:38,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:58:38,932 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:38,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 15:58:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-05 15:58:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:58:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-05 15:58:38,943 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-02-05 15:58:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:38,944 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-05 15:58:38,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:58:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-05 15:58:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:58:38,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:38,947 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:38,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:39,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-02-05 15:58:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067583150] [2025-02-05 15:58:39,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:39,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-05 15:58:39,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:39,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:39,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:58:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067583150] [2025-02-05 15:58:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067583150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475129526] [2025-02-05 15:58:39,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:39,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:39,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:39,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:58:39,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-05 15:58:39,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:58:39,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:39,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:39,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:39,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:58:39,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:58:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475129526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:39,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-02-05 15:58:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439098581] [2025-02-05 15:58:39,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:39,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 15:58:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:39,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 15:58:39,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:58:39,843 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 15:58:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:40,132 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-02-05 15:58:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:58:40,133 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-02-05 15:58:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:40,134 INFO L225 Difference]: With dead ends: 46 [2025-02-05 15:58:40,134 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 15:58:40,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-02-05 15:58:40,136 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:40,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 15:58:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-02-05 15:58:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-05 15:58:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-02-05 15:58:40,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-02-05 15:58:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:40,151 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-02-05 15:58:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 15:58:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-02-05 15:58:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:58:40,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:40,154 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:40,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:40,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-02-05 15:58:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346939238] [2025-02-05 15:58:40,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:40,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-02-05 15:58:40,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-02-05 15:58:40,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-02-05 15:58:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346939238] [2025-02-05 15:58:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346939238] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750630843] [2025-02-05 15:58:40,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:40,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:40,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:58:40,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-02-05 15:58:40,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-02-05 15:58:40,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:40,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:58:40,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-05 15:58:40,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-02-05 15:58:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750630843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:40,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-02-05 15:58:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157646353] [2025-02-05 15:58:40,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:58:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:40,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:58:40,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:58:40,982 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:58:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:41,074 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-02-05 15:58:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:41,075 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2025-02-05 15:58:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:41,076 INFO L225 Difference]: With dead ends: 62 [2025-02-05 15:58:41,079 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 15:58:41,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:58:41,080 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 15:58:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-02-05 15:58:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-05 15:58:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-02-05 15:58:41,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-02-05 15:58:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:41,091 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-02-05 15:58:41,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:58:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-02-05 15:58:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:58:41,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:41,094 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:41,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 15:58:41,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-02-05 15:58:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395545522] [2025-02-05 15:58:41,295 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:41,301 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:58:41,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-02-05 15:58:41,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-05 15:58:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395545522] [2025-02-05 15:58:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395545522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453214950] [2025-02-05 15:58:41,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:41,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:41,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:41,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:58:41,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:58:41,499 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-02-05 15:58:41,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:41,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:41,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-05 15:58:41,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-02-05 15:58:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453214950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:42,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-02-05 15:58:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527763805] [2025-02-05 15:58:42,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:58:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:42,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:58:42,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:58:42,140 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 15:58:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:42,207 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-02-05 15:58:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:58:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 93 [2025-02-05 15:58:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:42,208 INFO L225 Difference]: With dead ends: 41 [2025-02-05 15:58:42,208 INFO L226 Difference]: Without dead ends: 37 [2025-02-05 15:58:42,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:42,209 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:42,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:58:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-05 15:58:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-05 15:58:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2025-02-05 15:58:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2025-02-05 15:58:42,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 93 [2025-02-05 15:58:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2025-02-05 15:58:42,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 15:58:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2025-02-05 15:58:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 15:58:42,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:42,218 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:42,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:42,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:42,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash -398227603, now seen corresponding path program 5 times [2025-02-05 15:58:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051572493] [2025-02-05 15:58:42,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:42,432 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-02-05 15:58:42,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-02-05 15:58:42,443 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 15:58:42,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 259 proven. 360 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2025-02-05 15:58:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051572493] [2025-02-05 15:58:42,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051572493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727927930] [2025-02-05 15:58:42,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:42,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:42,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:42,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:42,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:58:42,602 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-02-05 15:58:42,621 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-02-05 15:58:42,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-05 15:58:42,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:42,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:42,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 1311 proven. 33 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-02-05 15:58:42,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 281 proven. 428 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked. [2025-02-05 15:58:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727927930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:43,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:43,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2025-02-05 15:58:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677277480] [2025-02-05 15:58:43,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:43,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:58:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:58:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:43,417 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-05 15:58:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:43,535 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-02-05 15:58:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:58:43,536 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) Word has length 203 [2025-02-05 15:58:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:43,537 INFO L225 Difference]: With dead ends: 85 [2025-02-05 15:58:43,537 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 15:58:43,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:43,538 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:43,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 15:58:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-02-05 15:58:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (35), 11 states have call predecessors, (35), 7 states have call successors, (35) [2025-02-05 15:58:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2025-02-05 15:58:43,544 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 203 [2025-02-05 15:58:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:43,545 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2025-02-05 15:58:43,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-02-05 15:58:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2025-02-05 15:58:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:58:43,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:43,546 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:43,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 15:58:43,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -73146455, now seen corresponding path program 6 times [2025-02-05 15:58:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189919309] [2025-02-05 15:58:43,748 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:43,753 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 161 statements into 18 equivalence classes. [2025-02-05 15:58:43,765 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 115 of 161 statements. [2025-02-05 15:58:43,765 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-02-05 15:58:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 141 proven. 262 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2025-02-05 15:58:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189919309] [2025-02-05 15:58:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189919309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855858789] [2025-02-05 15:58:43,863 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 15:58:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:43,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:43,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:58:43,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 161 statements into 18 equivalence classes. [2025-02-05 15:58:43,923 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 115 of 161 statements. [2025-02-05 15:58:43,923 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-02-05 15:58:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:43,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:43,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 141 proven. 262 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2025-02-05 15:58:43,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 141 proven. 279 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-02-05 15:58:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855858789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:44,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 12 [2025-02-05 15:58:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891822545] [2025-02-05 15:58:44,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:44,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:58:44,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:44,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:58:44,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:58:44,498 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-05 15:58:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:44,570 INFO L93 Difference]: Finished difference Result 65 states and 133 transitions. [2025-02-05 15:58:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:58:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 161 [2025-02-05 15:58:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:44,572 INFO L225 Difference]: With dead ends: 65 [2025-02-05 15:58:44,572 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 15:58:44,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:58:44,572 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:44,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 15:58:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2025-02-05 15:58:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (35), 11 states have call predecessors, (35), 7 states have call successors, (35) [2025-02-05 15:58:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2025-02-05 15:58:44,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 161 [2025-02-05 15:58:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:44,581 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2025-02-05 15:58:44,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 7 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-05 15:58:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2025-02-05 15:58:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 15:58:44,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:44,583 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:44,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:44,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1094095363, now seen corresponding path program 7 times [2025-02-05 15:58:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834920782] [2025-02-05 15:58:44,784 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:44,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 15:58:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 15:58:44,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:44,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 126 proven. 532 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-02-05 15:58:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834920782] [2025-02-05 15:58:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834920782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761998312] [2025-02-05 15:58:44,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 15:58:44,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:44,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:44,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:58:45,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 15:58:45,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 15:58:45,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:45,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:45,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:58:45,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 126 proven. 532 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-02-05 15:58:45,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 126 proven. 558 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2025-02-05 15:58:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761998312] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:45,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2025-02-05 15:58:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565255840] [2025-02-05 15:58:45,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:45,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:58:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:58:45,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:58:45,925 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-05 15:58:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:46,035 INFO L93 Difference]: Finished difference Result 75 states and 178 transitions. [2025-02-05 15:58:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:58:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 203 [2025-02-05 15:58:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:46,038 INFO L225 Difference]: With dead ends: 75 [2025-02-05 15:58:46,039 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 15:58:46,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 399 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:58:46,040 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:46,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 15:58:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2025-02-05 15:58:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (54), 14 states have call predecessors, (54), 8 states have call successors, (54) [2025-02-05 15:58:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 99 transitions. [2025-02-05 15:58:46,056 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 99 transitions. Word has length 203 [2025-02-05 15:58:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:46,057 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 99 transitions. [2025-02-05 15:58:46,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-05 15:58:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 99 transitions. [2025-02-05 15:58:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 15:58:46,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:46,062 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 37, 19, 19, 19, 19, 19, 19, 19, 18, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:46,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:46,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:46,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:46,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1885007967, now seen corresponding path program 8 times [2025-02-05 15:58:46,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:46,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114253713] [2025-02-05 15:58:46,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:46,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-02-05 15:58:46,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 15:58:46,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:46,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 163 proven. 957 refuted. 0 times theorem prover too weak. 3194 trivial. 0 not checked. [2025-02-05 15:58:46,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114253713] [2025-02-05 15:58:46,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114253713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926580428] [2025-02-05 15:58:46,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:58:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:46,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:46,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:58:46,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-02-05 15:58:46,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 15:58:46,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:58:46,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:46,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:58:46,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 163 proven. 957 refuted. 0 times theorem prover too weak. 3194 trivial. 0 not checked. [2025-02-05 15:58:46,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 163 proven. 997 refuted. 0 times theorem prover too weak. 3154 trivial. 0 not checked. [2025-02-05 15:58:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926580428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:47,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2025-02-05 15:58:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028269921] [2025-02-05 15:58:47,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:58:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:47,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:58:47,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:47,797 INFO L87 Difference]: Start difference. First operand 53 states and 99 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-05 15:58:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:47,925 INFO L93 Difference]: Finished difference Result 70 states and 154 transitions. [2025-02-05 15:58:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:58:47,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 275 [2025-02-05 15:58:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:47,927 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:58:47,927 INFO L226 Difference]: Without dead ends: 66 [2025-02-05 15:58:47,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 542 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:58:47,927 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:47,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 79 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-05 15:58:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2025-02-05 15:58:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 9 states have return successors, (61), 15 states have call predecessors, (61), 9 states have call successors, (61) [2025-02-05 15:58:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 108 transitions. [2025-02-05 15:58:47,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 108 transitions. Word has length 275 [2025-02-05 15:58:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:47,936 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 108 transitions. [2025-02-05 15:58:47,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-02-05 15:58:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 108 transitions. [2025-02-05 15:58:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 15:58:47,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:47,940 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 59, 34, 34, 34, 34, 34, 34, 34, 25, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:47,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:58:48,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:48,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -47464407, now seen corresponding path program 9 times [2025-02-05 15:58:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203276093] [2025-02-05 15:58:48,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:48,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 477 statements into 54 equivalence classes. [2025-02-05 15:58:48,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 477 statements. [2025-02-05 15:58:48,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:48,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13339 backedges. 1586 proven. 38 refuted. 0 times theorem prover too weak. 11715 trivial. 0 not checked. [2025-02-05 15:58:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203276093] [2025-02-05 15:58:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203276093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279021473] [2025-02-05 15:58:48,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:58:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:48,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:48,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:58:48,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 477 statements into 54 equivalence classes. [2025-02-05 15:58:48,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 62 of 477 statements. [2025-02-05 15:58:48,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 15:58:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:48,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:58:48,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13339 backedges. 1759 proven. 43 refuted. 0 times theorem prover too weak. 11537 trivial. 0 not checked. [2025-02-05 15:58:48,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13339 backedges. 1759 proven. 46 refuted. 0 times theorem prover too weak. 11534 trivial. 0 not checked. [2025-02-05 15:58:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279021473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:49,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2025-02-05 15:58:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439659406] [2025-02-05 15:58:49,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:58:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:58:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:58:49,508 INFO L87 Difference]: Start difference. First operand 55 states and 108 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-02-05 15:58:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:49,610 INFO L93 Difference]: Finished difference Result 107 states and 234 transitions. [2025-02-05 15:58:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:58:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) Word has length 477 [2025-02-05 15:58:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:49,611 INFO L225 Difference]: With dead ends: 107 [2025-02-05 15:58:49,611 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 15:58:49,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 946 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:58:49,612 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:49,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 15:58:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-05 15:58:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2025-02-05 15:58:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-02-05 15:58:49,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 477 [2025-02-05 15:58:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:49,619 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-02-05 15:58:49,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-02-05 15:58:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-02-05 15:58:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-05 15:58:49,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:49,627 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 52, 31, 31, 31, 31, 31, 31, 31, 21, 11, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:49,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:49,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:58:49,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -916822722, now seen corresponding path program 10 times [2025-02-05 15:58:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755490727] [2025-02-05 15:58:49,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:49,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 434 statements into 2 equivalence classes. [2025-02-05 15:58:49,865 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 369 of 434 statements. [2025-02-05 15:58:49,866 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:49,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 558 proven. 1127 refuted. 0 times theorem prover too weak. 9313 trivial. 0 not checked. [2025-02-05 15:58:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:58:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755490727] [2025-02-05 15:58:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755490727] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:58:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266204846] [2025-02-05 15:58:50,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:58:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:58:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:58:50,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:58:50,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:58:50,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 434 statements into 2 equivalence classes. [2025-02-05 15:58:50,269 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 369 of 434 statements. [2025-02-05 15:58:50,269 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 15:58:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:58:50,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 15:58:50,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:58:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 482 proven. 1702 refuted. 0 times theorem prover too weak. 8814 trivial. 0 not checked. [2025-02-05 15:58:50,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:58:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10998 backedges. 488 proven. 1747 refuted. 0 times theorem prover too weak. 8763 trivial. 0 not checked. [2025-02-05 15:58:52,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266204846] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:58:52,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:58:52,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 22 [2025-02-05 15:58:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762461047] [2025-02-05 15:58:52,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:58:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:58:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:58:52,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:58:52,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:58:52,201 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (26), 12 states have call predecessors, (26), 15 states have call successors, (26) [2025-02-05 15:58:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:58:52,342 INFO L93 Difference]: Finished difference Result 101 states and 265 transitions. [2025-02-05 15:58:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:58:52,345 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (26), 12 states have call predecessors, (26), 15 states have call successors, (26) Word has length 434 [2025-02-05 15:58:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:58:52,346 INFO L225 Difference]: With dead ends: 101 [2025-02-05 15:58:52,346 INFO L226 Difference]: Without dead ends: 55 [2025-02-05 15:58:52,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 853 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=279, Invalid=533, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:58:52,347 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:58:52,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 142 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:58:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-05 15:58:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-05 15:58:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-05 15:58:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-02-05 15:58:52,360 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 434 [2025-02-05 15:58:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:58:52,360 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-02-05 15:58:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (26), 12 states have call predecessors, (26), 15 states have call successors, (26) [2025-02-05 15:58:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-02-05 15:58:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-05 15:58:52,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:58:52,361 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:58:52,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 15:58:52,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:58:52,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:58:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:58:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1946424999, now seen corresponding path program 11 times [2025-02-05 15:58:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:58:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148725720] [2025-02-05 15:58:52,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 15:58:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:58:52,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 41 equivalence classes. [2025-02-05 15:58:52,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 15:58:52,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-02-05 15:58:52,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:58:52,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:58:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 15:58:52,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 15:58:52,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:58:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:58:52,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:58:52,679 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:58:52,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:58:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:58:52,683 INFO L422 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2025-02-05 15:58:52,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:58:52,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:58:52 BoogieIcfgContainer [2025-02-05 15:58:52,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:58:52,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:58:52,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:58:52,719 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:58:52,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:58:37" (3/4) ... [2025-02-05 15:58:52,720 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:58:52,771 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 158. [2025-02-05 15:58:52,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:58:52,856 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:58:52,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:58:52,856 INFO L158 Benchmark]: Toolchain (without parser) took 15748.83ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 123.6MB in the beginning and 178.9MB in the end (delta: -55.3MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 127.8MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.98ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 112.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.16ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: Boogie Preprocessor took 19.26ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.7MB in the end (delta: 833.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: IcfgBuilder took 189.50ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 101.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:52,857 INFO L158 Benchmark]: TraceAbstraction took 15206.88ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 100.2MB in the beginning and 191.5MB in the end (delta: -91.3MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:52,858 INFO L158 Benchmark]: Witness Printer took 136.88ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 178.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:58:52,859 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.14ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 127.8MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.98ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 112.7MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.16ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.26ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.7MB in the end (delta: 833.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 189.50ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 101.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15206.88ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 100.2MB in the beginning and 191.5MB in the end (delta: -91.3MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. * Witness Printer took 136.88ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 178.9MB in the end (delta: 12.6MB). 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [x=7] [L29] reach_error() VAL [x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 69, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 983 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 766 mSDsCounter, 362 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1060 IncrementalHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 362 mSolverCounterUnsat, 217 mSDtfsCounter, 1060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4215 GetRequests, 3965 SyntacticMatches, 50 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=11, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 4346 NumberOfCodeBlocks, 2946 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 6049 ConstructedInterpolants, 0 QuantifiedInterpolants, 8421 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3040 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 95068/106611 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:58:52,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE