./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/Fibonacci05.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 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:01:51,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:01:51,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:01:51,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:01:51,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:01:51,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:01:51,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:01:51,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:01:51,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:01:51,219 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:01:51,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:01:51,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:01:51,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:01:51,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:01:51,221 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:01:51,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:01:51,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:01:51,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:01:51,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:01:51,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:01:51,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:01:51,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:01:51,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:01:51,226 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 -> 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 [2025-02-07 21:01:51,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:01:51,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:01:51,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:01:51,513 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:01:51,513 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:01:51,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2025-02-07 21:01:52,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9cd3194/6411e6c7fd41409985601a3c4a4faef2/FLAG7646d033f [2025-02-07 21:01:53,096 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:01:53,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2025-02-07 21:01:53,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9cd3194/6411e6c7fd41409985601a3c4a4faef2/FLAG7646d033f [2025-02-07 21:01:53,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b9cd3194/6411e6c7fd41409985601a3c4a4faef2 [2025-02-07 21:01:53,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:01:53,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:01:53,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:01:53,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:01:53,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:01:53,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c476bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53, skipping insertion in model container [2025-02-07 21:01:53,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:01:53,575 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/Fibonacci05.c[788,801] [2025-02-07 21:01:53,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:01:53,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:01:53,597 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/Fibonacci05.c[788,801] [2025-02-07 21:01:53,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:01:53,609 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:01:53,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53 WrapperNode [2025-02-07 21:01:53,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:01:53,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:01:53,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:01:53,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:01:53,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,633 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-02-07 21:01:53,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:01:53,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:01:53,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:01:53,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:01:53,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,648 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-07 21:01:53,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:01:53,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:01:53,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:01:53,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:01:53,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (1/1) ... [2025-02-07 21:01:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:01:53,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:01:53,682 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-07 21:01:53,684 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-07 21:01:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-02-07 21:01:53,701 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-02-07 21:01:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:01:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:01:53,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:01:53,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:01:53,743 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:01:53,745 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:01:53,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-02-07 21:01:53,858 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-07 21:01:53,858 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:01:53,868 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:01:53,869 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:01:53,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:01:53 BoogieIcfgContainer [2025-02-07 21:01:53,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:01:53,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:01:53,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:01:53,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:01:53,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:01:53" (1/3) ... [2025-02-07 21:01:53,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3921ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:01:53, skipping insertion in model container [2025-02-07 21:01:53,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:01:53" (2/3) ... [2025-02-07 21:01:53,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3921ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:01:53, skipping insertion in model container [2025-02-07 21:01:53,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:01:53" (3/3) ... [2025-02-07 21:01:53,883 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2025-02-07 21:01:53,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:01:53,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05.c that has 2 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:01:53,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:01:53,969 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;@11e578f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:01:53,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:01:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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-07 21:01:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 21:01:53,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:53,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:01:53,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -426482455, now seen corresponding path program 1 times [2025-02-07 21:01:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513164243] [2025-02-07 21:01:53,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 21:01:54,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 21:01:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:54,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:01:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513164243] [2025-02-07 21:01:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513164243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:01:54,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:01:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:01:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385225785] [2025-02-07 21:01:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:01:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:01:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:01:54,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:01:54,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:01:54,239 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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), 5 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-07 21:01:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:01:54,346 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2025-02-07 21:01:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:01:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-07 21:01:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:01:54,355 INFO L225 Difference]: With dead ends: 27 [2025-02-07 21:01:54,355 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 21:01:54,359 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-07 21:01:54,362 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:01:54,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:01:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 21:01:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-07 21:01:54,397 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-07 21:01:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 21:01:54,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-02-07 21:01:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:01:54,402 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 21:01:54,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-07 21:01:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 21:01:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 21:01:54,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:54,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:01:54,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:01:54,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:54,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2101732680, now seen corresponding path program 1 times [2025-02-07 21:01:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873990517] [2025-02-07 21:01:54,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:54,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 21:01:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 21:01:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:54,498 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-07 21:01:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873990517] [2025-02-07 21:01:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873990517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:01:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:01:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:01:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68209951] [2025-02-07 21:01:54,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:01:54,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:01:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:01:54,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:01:54,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:01:54,501 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), 5 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-07 21:01:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:01:54,570 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-02-07 21:01:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:01:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-07 21:01:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:01:54,571 INFO L225 Difference]: With dead ends: 24 [2025-02-07 21:01:54,571 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 21:01:54,571 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-07 21:01:54,572 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:01:54,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:01:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 21:01:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-07 21:01:54,577 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-07 21:01:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 21:01:54,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-02-07 21:01:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:01:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 21:01:54,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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-07 21:01:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 21:01:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 21:01:54,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:54,581 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-07 21:01:54,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:01:54,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:54,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1449358034, now seen corresponding path program 1 times [2025-02-07 21:01:54,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:54,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674593] [2025-02-07 21:01:54,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:54,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 21:01:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 21:01:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:54,723 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-07 21:01:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674593] [2025-02-07 21:01:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:01:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893903912] [2025-02-07 21:01:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:01:54,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:01:54,729 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-07 21:01:54,731 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-07 21:01:54,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 21:01:54,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 21:01:54,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:54,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:54,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 21:01:54,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:01:54,891 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-07 21:01:54,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:01:55,124 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-07 21:01:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893903912] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:01:55,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:01:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-02-07 21:01:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554327752] [2025-02-07 21:01:55,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:01:55,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:01:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:01:55,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:01:55,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:01:55,129 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-07 21:01:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:01:55,267 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2025-02-07 21:01:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:01:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2025-02-07 21:01:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:01:55,269 INFO L225 Difference]: With dead ends: 42 [2025-02-07 21:01:55,269 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 21:01:55,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:01:55,270 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:01:55,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 55 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:01:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 21:01:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 21:01:55,276 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-07 21:01:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-07 21:01:55,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2025-02-07 21:01:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:01:55,277 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-07 21:01:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-07 21:01:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-07 21:01:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 21:01:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:55,279 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:01:55,288 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-07 21:01:55,481 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-07 21:01:55,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:55,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash 239303630, now seen corresponding path program 1 times [2025-02-07 21:01:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103855608] [2025-02-07 21:01:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:55,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 21:01:55,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 21:01:55,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:55,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-07 21:01:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103855608] [2025-02-07 21:01:55,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103855608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:01:55,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325841067] [2025-02-07 21:01:55,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:01:55,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:01:55,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:01:55,678 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-07 21:01:55,680 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-07 21:01:55,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 21:01:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 21:01:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:01:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:55,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:01:55,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:01:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-07 21:01:55,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:01:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 21:01:56,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325841067] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:01:56,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:01:56,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2025-02-07 21:01:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588725735] [2025-02-07 21:01:56,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:01:56,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:01:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:01:56,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:01:56,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:01:56,190 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-07 21:01:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:01:56,349 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. [2025-02-07 21:01:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:01:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 51 [2025-02-07 21:01:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:01:56,354 INFO L225 Difference]: With dead ends: 44 [2025-02-07 21:01:56,355 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 21:01:56,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:01:56,356 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:01:56,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 57 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:01:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 21:01:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-02-07 21:01:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-07 21:01:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2025-02-07 21:01:56,376 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 51 [2025-02-07 21:01:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:01:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 60 transitions. [2025-02-07 21:01:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-07 21:01:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2025-02-07 21:01:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-07 21:01:56,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:56,384 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 13, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:01:56,392 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-07 21:01:56,585 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-07 21:01:56,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:56,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1480788538, now seen corresponding path program 2 times [2025-02-07 21:01:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113903697] [2025-02-07 21:01:56,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:01:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:56,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-02-07 21:01:56,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-02-07 21:01:56,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:01:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 316 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-02-07 21:01:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113903697] [2025-02-07 21:01:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113903697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:01:56,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219718900] [2025-02-07 21:01:56,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:01:56,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:01:56,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:01:56,949 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-07 21:01:56,953 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-07 21:01:56,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-02-07 21:01:57,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-02-07 21:01:57,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:01:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:57,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:01:57,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:01:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 316 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-02-07 21:01:57,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:01:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 342 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-07 21:01:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219718900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:01:58,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:01:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2025-02-07 21:01:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160542909] [2025-02-07 21:01:58,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:01:58,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 21:01:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:01:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 21:01:58,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-02-07 21:01:58,159 INFO L87 Difference]: Start difference. First operand 35 states and 60 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:01:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:01:58,376 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2025-02-07 21:01:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 21:01:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) Word has length 131 [2025-02-07 21:01:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:01:58,379 INFO L225 Difference]: With dead ends: 54 [2025-02-07 21:01:58,379 INFO L226 Difference]: Without dead ends: 48 [2025-02-07 21:01:58,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:01:58,383 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 75 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:01:58,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 66 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:01:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-07 21:01:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-02-07 21:01:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (56), 13 states have call predecessors, (56), 8 states have call successors, (56) [2025-02-07 21:01:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 94 transitions. [2025-02-07 21:01:58,403 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 94 transitions. Word has length 131 [2025-02-07 21:01:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:01:58,404 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 94 transitions. [2025-02-07 21:01:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-07 21:01:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 94 transitions. [2025-02-07 21:01:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-07 21:01:58,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:01:58,413 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 39, 29, 29, 29, 29, 29, 29, 29, 20, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:01:58,421 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-07 21:01:58,618 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-07 21:01:58,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:01:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:01:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1943299980, now seen corresponding path program 3 times [2025-02-07 21:01:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:01:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964583351] [2025-02-07 21:01:58,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:01:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:01:58,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 397 statements into 46 equivalence classes. [2025-02-07 21:01:58,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 50 of 397 statements. [2025-02-07 21:01:58,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 21:01:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 1062 proven. 7 refuted. 0 times theorem prover too weak. 8140 trivial. 0 not checked. [2025-02-07 21:01:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:01:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964583351] [2025-02-07 21:01:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964583351] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:01:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717549705] [2025-02-07 21:01:58,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:01:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:01:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:01:58,773 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-07 21:01:58,776 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-07 21:01:58,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 397 statements into 46 equivalence classes. [2025-02-07 21:01:58,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 50 of 397 statements. [2025-02-07 21:01:58,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 21:01:58,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:01:58,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 21:01:58,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:01:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 1252 proven. 12 refuted. 0 times theorem prover too weak. 7945 trivial. 0 not checked. [2025-02-07 21:01:58,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:02:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 1252 proven. 14 refuted. 0 times theorem prover too weak. 7943 trivial. 0 not checked. [2025-02-07 21:02:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717549705] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:02:00,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:02:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2025-02-07 21:02:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056231417] [2025-02-07 21:02:00,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:02:00,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 21:02:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:02:00,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 21:02:00,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:02:00,204 INFO L87 Difference]: Start difference. First operand 45 states and 94 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-07 21:02:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:02:00,314 INFO L93 Difference]: Finished difference Result 92 states and 239 transitions. [2025-02-07 21:02:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:02:00,314 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 397 [2025-02-07 21:02:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:02:00,317 INFO L225 Difference]: With dead ends: 92 [2025-02-07 21:02:00,320 INFO L226 Difference]: Without dead ends: 50 [2025-02-07 21:02:00,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 784 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-02-07 21:02:00,323 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:02:00,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 73 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:02:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-07 21:02:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-02-07 21:02:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 8 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (51), 13 states have call predecessors, (51), 8 states have call successors, (51) [2025-02-07 21:02:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. [2025-02-07 21:02:00,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 91 transitions. Word has length 397 [2025-02-07 21:02:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:02:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 91 transitions. [2025-02-07 21:02:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-07 21:02:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. [2025-02-07 21:02:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-02-07 21:02:00,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:02:00,348 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 71, 41, 41, 41, 41, 41, 41, 41, 30, 12, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:02:00,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 21:02:00,548 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-07 21:02:00,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:02:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:02:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1522921012, now seen corresponding path program 4 times [2025-02-07 21:02:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:02:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124037117] [2025-02-07 21:02:00,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:02:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:02:00,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-02-07 21:02:00,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 487 of 573 statements. [2025-02-07 21:02:00,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:02:00,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19377 backedges. 679 proven. 2647 refuted. 0 times theorem prover too weak. 16051 trivial. 0 not checked. [2025-02-07 21:02:01,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:02:01,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124037117] [2025-02-07 21:02:01,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124037117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:02:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762162597] [2025-02-07 21:02:01,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:02:01,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:02:01,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:02:01,274 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-07 21:02:01,276 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-07 21:02:01,361 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-02-07 21:02:01,469 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 487 of 573 statements. [2025-02-07 21:02:01,469 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 21:02:01,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:01,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:02:01,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:02:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19377 backedges. 5662 proven. 170 refuted. 0 times theorem prover too weak. 13545 trivial. 0 not checked. [2025-02-07 21:02:01,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:02:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 19377 backedges. 578 proven. 2992 refuted. 0 times theorem prover too weak. 15807 trivial. 0 not checked. [2025-02-07 21:02:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762162597] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:02:03,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:02:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 23 [2025-02-07 21:02:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814922676] [2025-02-07 21:02:03,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:02:03,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:02:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:02:03,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:02:03,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:02:03,900 INFO L87 Difference]: Start difference. First operand 47 states and 91 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 17 states have call successors, (24), 2 states have call predecessors, (24), 10 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) [2025-02-07 21:02:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:02:04,206 INFO L93 Difference]: Finished difference Result 110 states and 240 transitions. [2025-02-07 21:02:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 21:02:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 17 states have call successors, (24), 2 states have call predecessors, (24), 10 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) Word has length 573 [2025-02-07 21:02:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:02:04,208 INFO L225 Difference]: With dead ends: 110 [2025-02-07 21:02:04,208 INFO L226 Difference]: Without dead ends: 66 [2025-02-07 21:02:04,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1133 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=384, Invalid=1098, Unknown=0, NotChecked=0, Total=1482 [2025-02-07 21:02:04,210 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 90 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:02:04,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 129 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:02:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-07 21:02:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-07 21:02:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 44 states have internal predecessors, (51), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2025-02-07 21:02:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2025-02-07 21:02:04,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 573 [2025-02-07 21:02:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:02:04,218 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2025-02-07 21:02:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 23 states have internal predecessors, (75), 17 states have call successors, (24), 2 states have call predecessors, (24), 10 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) [2025-02-07 21:02:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2025-02-07 21:02:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-07 21:02:04,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:02:04,224 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 51, 31, 31, 31, 31, 31, 31, 31, 20, 12, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:02:04,232 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-07 21:02:04,424 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-07 21:02:04,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:02:04,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:02:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1753750540, now seen corresponding path program 5 times [2025-02-07 21:02:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:02:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568775755] [2025-02-07 21:02:04,426 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:02:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:02:04,440 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 433 statements into 53 equivalence classes. [2025-02-07 21:02:04,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 331 of 433 statements. [2025-02-07 21:02:04,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-02-07 21:02:04,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 2245 proven. 814 refuted. 0 times theorem prover too weak. 7888 trivial. 0 not checked. [2025-02-07 21:02:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:02:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568775755] [2025-02-07 21:02:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568775755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:02:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437386879] [2025-02-07 21:02:05,132 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 21:02:05,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:02:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:02:05,134 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-07 21:02:05,137 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-07 21:02:05,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 433 statements into 53 equivalence classes. [2025-02-07 21:02:05,348 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 331 of 433 statements. [2025-02-07 21:02:05,349 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-02-07 21:02:05,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:05,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 21:02:05,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:02:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 2271 proven. 813 refuted. 0 times theorem prover too weak. 7863 trivial. 0 not checked. [2025-02-07 21:02:05,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:02:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 2268 proven. 854 refuted. 0 times theorem prover too weak. 7825 trivial. 0 not checked. [2025-02-07 21:02:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437386879] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:02:08,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:02:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 22] total 30 [2025-02-07 21:02:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750687150] [2025-02-07 21:02:08,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:02:08,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 21:02:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:02:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 21:02:08,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:02:08,154 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-02-07 21:02:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:02:08,569 INFO L93 Difference]: Finished difference Result 149 states and 241 transitions. [2025-02-07 21:02:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 21:02:08,570 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) Word has length 433 [2025-02-07 21:02:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:02:08,574 INFO L225 Difference]: With dead ends: 149 [2025-02-07 21:02:08,574 INFO L226 Difference]: Without dead ends: 88 [2025-02-07 21:02:08,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 849 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=1820, Unknown=0, NotChecked=0, Total=2450 [2025-02-07 21:02:08,577 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 122 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:02:08,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 139 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:02:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-07 21:02:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2025-02-07 21:02:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 53 states have internal predecessors, (59), 13 states have call successors, (13), 11 states have call predecessors, (13), 8 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2025-02-07 21:02:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2025-02-07 21:02:08,593 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 433 [2025-02-07 21:02:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:02:08,596 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-02-07 21:02:08,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 21 states have call successors, (26), 1 states have call predecessors, (26), 12 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-02-07 21:02:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2025-02-07 21:02:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-07 21:02:08,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:02:08,598 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 46, 28, 28, 28, 28, 28, 28, 28, 18, 11, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:02:08,607 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-07 21:02:08,798 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-07 21:02:08,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:02:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:02:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1422620861, now seen corresponding path program 6 times [2025-02-07 21:02:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:02:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794123725] [2025-02-07 21:02:08,799 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:02:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:02:08,813 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 392 statements into 50 equivalence classes. [2025-02-07 21:02:08,849 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 155 of 392 statements. [2025-02-07 21:02:08,849 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-02-07 21:02:08,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 383 proven. 1309 refuted. 0 times theorem prover too weak. 7239 trivial. 0 not checked. [2025-02-07 21:02:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:02:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794123725] [2025-02-07 21:02:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794123725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:02:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638911911] [2025-02-07 21:02:09,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 21:02:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:02:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:02:09,031 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-07 21:02:09,032 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-07 21:02:09,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 392 statements into 50 equivalence classes. [2025-02-07 21:02:09,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) and asserted 155 of 392 statements. [2025-02-07 21:02:09,187 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2025-02-07 21:02:09,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:09,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:02:09,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:02:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 371 proven. 1307 refuted. 0 times theorem prover too weak. 7253 trivial. 0 not checked. [2025-02-07 21:02:09,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:02:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 375 proven. 1343 refuted. 0 times theorem prover too weak. 7213 trivial. 0 not checked. [2025-02-07 21:02:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638911911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:02:10,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:02:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 17 [2025-02-07 21:02:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049874888] [2025-02-07 21:02:10,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:02:10,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 21:02:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:02:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 21:02:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:02:10,920 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-07 21:02:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:02:11,127 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2025-02-07 21:02:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:02:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) Word has length 392 [2025-02-07 21:02:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:02:11,135 INFO L225 Difference]: With dead ends: 252 [2025-02-07 21:02:11,135 INFO L226 Difference]: Without dead ends: 248 [2025-02-07 21:02:11,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 775 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:02:11,137 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 94 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:02:11,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 87 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:02:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-07 21:02:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 210. [2025-02-07 21:02:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 139 states have internal predecessors, (151), 43 states have call successors, (43), 26 states have call predecessors, (43), 21 states have return successors, (113), 44 states have call predecessors, (113), 43 states have call successors, (113) [2025-02-07 21:02:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2025-02-07 21:02:11,178 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 392 [2025-02-07 21:02:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:02:11,181 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2025-02-07 21:02:11,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2025-02-07 21:02:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2025-02-07 21:02:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-07 21:02:11,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:02:11,185 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 57, 35, 35, 35, 35, 35, 35, 35, 22, 14, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:02:11,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 21:02:11,390 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-07 21:02:11,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:02:11,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:02:11,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1200851454, now seen corresponding path program 7 times [2025-02-07 21:02:11,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:02:11,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580753137] [2025-02-07 21:02:11,391 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:02:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:02:11,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-07 21:02:11,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-07 21:02:11,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:02:11,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 708 proven. 1074 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2025-02-07 21:02:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:02:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580753137] [2025-02-07 21:02:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580753137] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:02:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405217357] [2025-02-07 21:02:11,791 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 21:02:11,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:02:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:02:11,793 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-07 21:02:11,796 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-07 21:02:11,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-07 21:02:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-07 21:02:12,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:02:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:02:12,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 21:02:12,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:02:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 824 proven. 1312 refuted. 0 times theorem prover too weak. 11780 trivial. 0 not checked. [2025-02-07 21:02:12,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:02:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 830 proven. 1346 refuted. 0 times theorem prover too weak. 11740 trivial. 0 not checked. [2025-02-07 21:02:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405217357] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:02:13,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:02:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 15] total 16 [2025-02-07 21:02:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040410770] [2025-02-07 21:02:13,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:02:13,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 21:02:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:02:13,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 21:02:13,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-07 21:02:13,872 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2025-02-07 21:02:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:02:13,988 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2025-02-07 21:02:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 21:02:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) Word has length 487 [2025-02-07 21:02:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:02:13,994 INFO L225 Difference]: With dead ends: 257 [2025-02-07 21:02:13,994 INFO L226 Difference]: Without dead ends: 253 [2025-02-07 21:02:13,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 964 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:02:13,995 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:02:13,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:02:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-07 21:02:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2025-02-07 21:02:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 148 states have (on average 1.0405405405405406) internal successors, (154), 142 states have internal predecessors, (154), 44 states have call successors, (44), 26 states have call predecessors, (44), 22 states have return successors, (123), 46 states have call predecessors, (123), 44 states have call successors, (123) [2025-02-07 21:02:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 321 transitions. [2025-02-07 21:02:14,038 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 321 transitions. Word has length 487 [2025-02-07 21:02:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:02:14,039 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 321 transitions. [2025-02-07 21:02:14,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2025-02-07 21:02:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 321 transitions. [2025-02-07 21:02:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-07 21:02:14,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:02:14,043 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:02:14,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 21:02:14,248 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-07 21:02:14,248 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:02:14,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:02:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1906933971, now seen corresponding path program 8 times [2025-02-07 21:02:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:02:14,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798642553] [2025-02-07 21:02:14,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:02:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:02:14,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 460 statements into 2 equivalence classes. [2025-02-07 21:02:14,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-02-07 21:02:14,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:02:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:02:14,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:02:14,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-07 21:02:14,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-07 21:02:14,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:02:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:02:14,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:02:14,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:02:14,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:02:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:02:14,425 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2025-02-07 21:02:14,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:02:14,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:02:14 BoogieIcfgContainer [2025-02-07 21:02:14,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:02:14,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:02:14,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:02:14,528 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:02:14,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:01:53" (3/4) ... [2025-02-07 21:02:14,529 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:02:14,641 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 258. [2025-02-07 21:02:14,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:02:14,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:02:14,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:02:14,804 INFO L158 Benchmark]: Toolchain (without parser) took 21367.11ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 132.7MB in the beginning and 117.7MB in the end (delta: 15.0MB). Peak memory consumption was 182.7MB. Max. memory is 16.1GB. [2025-02-07 21:02:14,804 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:02:14,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.24ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 122.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:02:14,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.75ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:02:14,805 INFO L158 Benchmark]: Boogie Preprocessor took 18.48ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 120.0MB in the end (delta: 828.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:02:14,805 INFO L158 Benchmark]: IcfgBuilder took 215.99ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 109.4MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:02:14,805 INFO L158 Benchmark]: TraceAbstraction took 20654.18ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 108.5MB in the beginning and 138.0MB in the end (delta: -29.4MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. [2025-02-07 21:02:14,806 INFO L158 Benchmark]: Witness Printer took 275.94ms. Allocated memory is still 335.5MB. Free memory was 138.0MB in the beginning and 117.7MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:02:14,807 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.39ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.24ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 122.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.75ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.48ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 120.0MB in the end (delta: 828.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 215.99ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 109.4MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20654.18ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 108.5MB in the beginning and 138.0MB in the end (delta: -29.4MB). Peak memory consumption was 132.4MB. Max. memory is 16.1GB. * Witness Printer took 275.94ms. Allocated memory is still 335.5MB. Free memory was 138.0MB in the beginning and 117.7MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. 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: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] COND FALSE !(x > 46) VAL [x=8] [L32] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L32] RET, EXPR fibonacci(x) VAL [x=8] [L32] int result = fibonacci(x); [L33] COND FALSE !(x < 8 || result >= 34) [L36] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 11, TraceHistogramMax: 83, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 751 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1071 IncrementalHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 591 mSolverCounterUnsat, 168 mSDtfsCounter, 1071 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5137 GetRequests, 4903 SyntacticMatches, 42 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=10, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 99 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 5455 NumberOfCodeBlocks, 3911 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 7456 ConstructedInterpolants, 0 QuantifiedInterpolants, 9755 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3870 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 173057/190212 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-07 21:02:14,832 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