./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42036c90cf17a9bca9878c7ba1e2de2c7beff8028a525d1b2b84e3f8cdd299d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:10,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:10,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:10,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:10,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:10,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:10,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:10,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:10,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:10,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:10,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:10,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:10,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:10,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:10,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:10,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:10,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:10,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:10,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:10,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:10,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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-03-04 11:28:10,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:10,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:10,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:10,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:10,446 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:10,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2025-03-04 11:28:11,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d79b54/c6f1b16a688a470198f1741ba6806f7e/FLAGe1abfb551 [2025-03-04 11:28:11,853 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:11,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2025-03-04 11:28:11,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d79b54/c6f1b16a688a470198f1741ba6806f7e/FLAGe1abfb551 [2025-03-04 11:28:12,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d79b54/c6f1b16a688a470198f1741ba6806f7e [2025-03-04 11:28:12,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:12,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:12,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:12,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:12,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:12,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30490454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12, skipping insertion in model container [2025-03-04 11:28:12,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:12,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:12,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:12,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:12,358 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:12,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12 WrapperNode [2025-03-04 11:28:12,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:12,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:12,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:12,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:12,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,380 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 11:28:12,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:12,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:12,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:12,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:12,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,400 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:28:12,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:12,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:12,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:12,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:12,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (1/1) ... [2025-03-04 11:28:12,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:12,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 11:28:12,465 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 11:28:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:12,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:12,508 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:12,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:12,570 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-04 11:28:12,606 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:12,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:12,615 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:12,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:12,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:12 BoogieIcfgContainer [2025-03-04 11:28:12,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:12,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:12,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:12,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:12,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:12" (1/3) ... [2025-03-04 11:28:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bccc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:12, skipping insertion in model container [2025-03-04 11:28:12,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:12" (2/3) ... [2025-03-04 11:28:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bccc6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:12, skipping insertion in model container [2025-03-04 11:28:12,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:12" (3/3) ... [2025-03-04 11:28:12,623 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2025-03-04 11:28:12,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:12,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci05.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:12,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:12,676 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;@6e75693c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:12,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 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-03-04 11:28:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:12,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:12,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:12,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 154990982, now seen corresponding path program 1 times [2025-03-04 11:28:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770986608] [2025-03-04 11:28:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:12,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:12,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:12,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:12,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770986608] [2025-03-04 11:28:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770986608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:12,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966155480] [2025-03-04 11:28:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:12,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:12,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:12,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:12,858 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 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 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:12,899 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-04 11:28:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:28:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:12,907 INFO L225 Difference]: With dead ends: 37 [2025-03-04 11:28:12,907 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 11:28:12,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:12,911 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:12,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 11:28:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-04 11:28:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-04 11:28:12,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-03-04 11:28:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:12,941 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-04 11:28:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-04 11:28:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:28:12,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:12,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:12,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:12,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 509753131, now seen corresponding path program 1 times [2025-03-04 11:28:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800700802] [2025-03-04 11:28:12,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:28:12,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:28:12,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:12,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800700802] [2025-03-04 11:28:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800700802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:13,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:13,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048999340] [2025-03-04 11:28:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:13,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:13,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:13,027 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:13,100 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-04 11:28:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:13,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 11:28:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:13,102 INFO L225 Difference]: With dead ends: 25 [2025-03-04 11:28:13,102 INFO L226 Difference]: Without dead ends: 23 [2025-03-04 11:28:13,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:13,104 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:13,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-04 11:28:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-04 11:28:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-04 11:28:13,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2025-03-04 11:28:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-04 11:28:13,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-04 11:28:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:28:13,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:13,112 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:13,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:13,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:13,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash -984405394, now seen corresponding path program 1 times [2025-03-04 11:28:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836191788] [2025-03-04 11:28:13,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:13,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:28:13,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:28:13,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:28:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836191788] [2025-03-04 11:28:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836191788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328831118] [2025-03-04 11:28:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:13,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:13,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:13,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:13,256 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:13,294 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-04 11:28:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 11:28:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:13,295 INFO L225 Difference]: With dead ends: 35 [2025-03-04 11:28:13,295 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 11:28:13,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:13,296 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 11:28:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 11:28:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:28:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-04 11:28:13,307 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2025-03-04 11:28:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-04 11:28:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-04 11:28:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:28:13,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:13,310 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:13,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:13,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash -119709208, now seen corresponding path program 1 times [2025-03-04 11:28:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31523456] [2025-03-04 11:28:13,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:13,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:13,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:28:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31523456] [2025-03-04 11:28:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31523456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240093482] [2025-03-04 11:28:13,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:13,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:13,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:13,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:13,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:13,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:13,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:13,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:28:13,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:28:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240093482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:13,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 11:28:13,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488569898] [2025-03-04 11:28:13,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:13,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:28:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:13,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:28:13,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:13,735 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:28:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:13,976 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-04 11:28:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:28:13,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-04 11:28:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:13,977 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:28:13,977 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 11:28:13,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:13,979 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:13,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 11:28:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-04 11:28:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:28:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-03-04 11:28:13,995 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2025-03-04 11:28:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:13,995 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-03-04 11:28:13,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:28:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-03-04 11:28:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:28:13,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:13,997 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:14,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1220480843, now seen corresponding path program 2 times [2025-03-04 11:28:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866719744] [2025-03-04 11:28:14,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:14,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 11:28:14,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:14,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:14,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:14,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:14,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866719744] [2025-03-04 11:28:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866719744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:14,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235818780] [2025-03-04 11:28:14,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:14,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:14,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:14,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:14,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 11:28:14,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:14,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:14,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:14,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:28:14,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:14,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235818780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 11:28:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472556550] [2025-03-04 11:28:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:14,369 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:14,400 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-04 11:28:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:14,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 11:28:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:14,402 INFO L225 Difference]: With dead ends: 60 [2025-03-04 11:28:14,404 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 11:28:14,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:28:14,405 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:14,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 11:28:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-04 11:28:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:28:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-03-04 11:28:14,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-03-04 11:28:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:14,420 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-03-04 11:28:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-03-04 11:28:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:28:14,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:14,421 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:14,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:14,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -819799558, now seen corresponding path program 1 times [2025-03-04 11:28:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:14,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915150851] [2025-03-04 11:28:14,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:14,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:14,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:14,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915150851] [2025-03-04 11:28:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915150851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137108637] [2025-03-04 11:28:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:14,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:14,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:14,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:14,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:14,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:14,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:14,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:14,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:28:14,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137108637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:28:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696252246] [2025-03-04 11:28:14,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:14,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:14,781 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:14,814 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-04 11:28:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 11:28:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:14,816 INFO L225 Difference]: With dead ends: 82 [2025-03-04 11:28:14,816 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 11:28:14,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:14,818 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:14,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 11:28:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-04 11:28:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 11:28:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-04 11:28:14,834 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 26 [2025-03-04 11:28:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:14,834 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-04 11:28:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:28:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-04 11:28:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:28:14,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:14,837 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:14,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:15,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:15,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1588695901, now seen corresponding path program 1 times [2025-03-04 11:28:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017263485] [2025-03-04 11:28:15,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:15,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:28:15,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:28:15,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 11:28:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017263485] [2025-03-04 11:28:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017263485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:15,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113776182] [2025-03-04 11:28:15,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:15,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:15,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:15,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:15,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:28:15,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:28:15,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:15,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:15,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:28:15,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 11:28:15,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 11:28:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113776182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:15,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:15,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 11:28:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759333726] [2025-03-04 11:28:15,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:15,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:28:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:15,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:28:15,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:15,466 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:15,630 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-03-04 11:28:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:28:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 52 [2025-03-04 11:28:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:15,634 INFO L225 Difference]: With dead ends: 141 [2025-03-04 11:28:15,635 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 11:28:15,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:28:15,636 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:15,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 11:28:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-03-04 11:28:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 75 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-04 11:28:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-03-04 11:28:15,661 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 52 [2025-03-04 11:28:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:15,661 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-03-04 11:28:15,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-03-04 11:28:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 11:28:15,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:15,664 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:15,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:15,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:15,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 993600403, now seen corresponding path program 1 times [2025-03-04 11:28:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-03-04 11:28:15,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:15,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:28:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:28:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 11:28:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237998813] [2025-03-04 11:28:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237998813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913256433] [2025-03-04 11:28:16,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:16,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:16,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:16,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 11:28:16,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 11:28:16,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:16,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:28:16,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-04 11:28:16,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 11:28:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913256433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:16,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 18 [2025-03-04 11:28:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080383986] [2025-03-04 11:28:16,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:28:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:28:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:28:16,319 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:28:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:16,813 INFO L93 Difference]: Finished difference Result 257 states and 504 transitions. [2025-03-04 11:28:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 11:28:16,814 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) Word has length 63 [2025-03-04 11:28:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:16,816 INFO L225 Difference]: With dead ends: 257 [2025-03-04 11:28:16,816 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 11:28:16,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 11:28:16,819 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:16,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 11:28:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2025-03-04 11:28:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 12 states have call successors, (12), 3 states have call predecessors, (12), 10 states have return successors, (75), 19 states have call predecessors, (75), 11 states have call successors, (75) [2025-03-04 11:28:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2025-03-04 11:28:16,846 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 63 [2025-03-04 11:28:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:16,846 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 171 transitions. [2025-03-04 11:28:16,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 11:28:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 171 transitions. [2025-03-04 11:28:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 11:28:16,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:16,850 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:28:16,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:17,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:17,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1513623466, now seen corresponding path program 2 times [2025-03-04 11:28:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228833168] [2025-03-04 11:28:17,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:17,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-04 11:28:17,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 11:28:17,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:17,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 35 proven. 126 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-04 11:28:17,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228833168] [2025-03-04 11:28:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228833168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460040704] [2025-03-04 11:28:17,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:17,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:17,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:17,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-04 11:28:17,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 11:28:17,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:17,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:17,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 11:28:17,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 11:28:17,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 11:28:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460040704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:17,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:17,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 11:28:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481016087] [2025-03-04 11:28:17,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:17,622 INFO L87 Difference]: Start difference. First operand 103 states and 171 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:17,694 INFO L93 Difference]: Finished difference Result 162 states and 278 transitions. [2025-03-04 11:28:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 129 [2025-03-04 11:28:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:17,696 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:28:17,696 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:28:17,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:17,697 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:17,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:28:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 11:28:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (26), 10 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 11:28:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-04 11:28:17,703 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 129 [2025-03-04 11:28:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:17,704 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-04 11:28:17,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-04 11:28:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 11:28:17,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:17,705 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:28:17,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:17,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:17,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1695716789, now seen corresponding path program 3 times [2025-03-04 11:28:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-03-04 11:28:17,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:17,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-04 11:28:17,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-04 11:28:17,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:28:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 207 proven. 18 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:28:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456044656] [2025-03-04 11:28:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456044656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883777130] [2025-03-04 11:28:18,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:18,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:18,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:18,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:18,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:18,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-04 11:28:18,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-04 11:28:18,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 11:28:18,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:28:18,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 11:28:18,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 22 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-04 11:28:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883777130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:18,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-04 11:28:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154427889] [2025-03-04 11:28:18,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:18,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:18,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:18,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:18,358 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:18,442 INFO L93 Difference]: Finished difference Result 124 states and 179 transitions. [2025-03-04 11:28:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:28:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 130 [2025-03-04 11:28:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:18,444 INFO L225 Difference]: With dead ends: 124 [2025-03-04 11:28:18,444 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 11:28:18,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:18,444 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:18,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 81 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 11:28:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 11:28:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (22), 10 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 11:28:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2025-03-04 11:28:18,450 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 130 [2025-03-04 11:28:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:18,450 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2025-03-04 11:28:18,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 11:28:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2025-03-04 11:28:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:28:18,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:18,451 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:28:18,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:28:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:18,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1396439778, now seen corresponding path program 4 times [2025-03-04 11:28:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-03-04 11:28:18,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:18,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-04 11:28:18,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 124 statements. [2025-03-04 11:28:18,662 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:18,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 97 proven. 216 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 11:28:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-03-04 11:28:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001586961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:18,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020263277] [2025-03-04 11:28:18,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:18,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:18,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:18,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:18,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:18,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-04 11:28:18,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 124 statements. [2025-03-04 11:28:18,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:18,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:28:18,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 218 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 11:28:18,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 234 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-04 11:28:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020263277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:19,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-04 11:28:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494471966] [2025-03-04 11:28:19,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:28:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:19,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:28:19,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:28:19,452 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:28:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:19,673 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2025-03-04 11:28:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:28:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) Word has length 124 [2025-03-04 11:28:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:19,675 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:28:19,675 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 11:28:19,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:28:19,676 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:19,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 107 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 11:28:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-03-04 11:28:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:28:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-04 11:28:19,684 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 124 [2025-03-04 11:28:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:19,684 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-04 11:28:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-04 11:28:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-04 11:28:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 11:28:19,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:19,686 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 1, 1, 1, 1, 1] [2025-03-04 11:28:19,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:28:19,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -552937243, now seen corresponding path program 5 times [2025-03-04 11:28:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846259897] [2025-03-04 11:28:19,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:19,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-04 11:28:19,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-04 11:28:19,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 11:28:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 281 proven. 362 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-04 11:28:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846259897] [2025-03-04 11:28:20,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846259897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715133459] [2025-03-04 11:28:20,143 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:20,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:20,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:20,178 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-04 11:28:20,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-04 11:28:20,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 11:28:20,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:20,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:28:20,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 263 proven. 345 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-03-04 11:28:20,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 267 proven. 357 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-04 11:28:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715133459] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:20,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 21 [2025-03-04 11:28:20,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152628492] [2025-03-04 11:28:20,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:28:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:20,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:28:20,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:28:20,796 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 11:28:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:21,068 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2025-03-04 11:28:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:28:21,072 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) Word has length 183 [2025-03-04 11:28:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:21,073 INFO L225 Difference]: With dead ends: 149 [2025-03-04 11:28:21,073 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 11:28:21,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 357 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:21,075 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:21,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 124 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 11:28:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-04 11:28:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.0625) internal successors, (68), 62 states have internal predecessors, (68), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 11:28:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-04 11:28:21,084 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 183 [2025-03-04 11:28:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:21,084 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-04 11:28:21,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-04 11:28:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-04 11:28:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 11:28:21,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:21,085 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-04 11:28:21,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:28:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:21,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536077, now seen corresponding path program 6 times [2025-03-04 11:28:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:21,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762759910] [2025-03-04 11:28:21,286 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:21,290 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-04 11:28:21,304 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 11:28:21,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-04 11:28:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 183 proven. 132 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-04 11:28:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762759910] [2025-03-04 11:28:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762759910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894862053] [2025-03-04 11:28:21,445 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:21,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:21,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:21,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:28:21,487 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-04 11:28:21,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 11:28:21,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-04 11:28:21,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:21,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:28:21,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 61 proven. 95 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 11:28:21,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 103 proven. 95 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-04 11:28:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894862053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:22,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-04 11:28:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095355847] [2025-03-04 11:28:22,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 11:28:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 11:28:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 11:28:22,541 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-04 11:28:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:23,003 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-03-04 11:28:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:28:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) Word has length 130 [2025-03-04 11:28:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:23,005 INFO L225 Difference]: With dead ends: 203 [2025-03-04 11:28:23,005 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 11:28:23,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:28:23,006 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 129 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:23,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 124 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:28:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 11:28:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2025-03-04 11:28:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-04 11:28:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2025-03-04 11:28:23,013 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 130 [2025-03-04 11:28:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:23,013 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2025-03-04 11:28:23,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-04 11:28:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2025-03-04 11:28:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-04 11:28:23,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:23,017 INFO L218 NwaCegarLoop]: trace histogram [49, 45, 40, 25, 25, 25, 25, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1, 1] [2025-03-04 11:28:23,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:23,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:28:23,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:23,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1194404785, now seen corresponding path program 7 times [2025-03-04 11:28:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:23,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-04 11:28:23,222 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 11:28:23,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 11:28:23,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:23,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 593 proven. 1908 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2025-03-04 11:28:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009933551] [2025-03-04 11:28:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009933551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386418851] [2025-03-04 11:28:23,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:23,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:23,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:28:23,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 11:28:23,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 11:28:23,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:23,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:23,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 4011 proven. 1274 refuted. 0 times theorem prover too weak. 2432 trivial. 0 not checked. [2025-03-04 11:28:23,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 684 proven. 2447 refuted. 0 times theorem prover too weak. 4586 trivial. 0 not checked. [2025-03-04 11:28:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386418851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:25,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 21] total 26 [2025-03-04 11:28:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238420786] [2025-03-04 11:28:25,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:25,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:25,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:25,005 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-04 11:28:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:25,309 INFO L93 Difference]: Finished difference Result 233 states and 308 transitions. [2025-03-04 11:28:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:28:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) Word has length 465 [2025-03-04 11:28:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:25,311 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:28:25,311 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 11:28:25,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 915 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=568, Invalid=1502, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:28:25,312 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 227 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:25,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 127 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 11:28:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2025-03-04 11:28:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.0625) internal successors, (102), 93 states have internal predecessors, (102), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-04 11:28:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2025-03-04 11:28:25,321 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 465 [2025-03-04 11:28:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:25,322 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2025-03-04 11:28:25,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-04 11:28:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2025-03-04 11:28:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-04 11:28:25,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:25,327 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 26, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1, 1] [2025-03-04 11:28:25,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:28:25,527 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:25,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash -449393690, now seen corresponding path program 8 times [2025-03-04 11:28:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-04 11:28:25,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:25,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-04 11:28:25,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 11:28:25,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:25,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 554 proven. 990 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2025-03-04 11:28:25,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645643307] [2025-03-04 11:28:25,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645643307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238257082] [2025-03-04 11:28:25,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:25,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:25,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:25,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:25,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:28:25,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-04 11:28:25,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 11:28:25,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:28:25,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 1858 proven. 484 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2025-03-04 11:28:26,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 551 proven. 1101 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-03-04 11:28:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238257082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:27,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-04 11:28:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2425982] [2025-03-04 11:28:27,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:28:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:28:27,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:28:27,148 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:28:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,372 INFO L93 Difference]: Finished difference Result 232 states and 300 transitions. [2025-03-04 11:28:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:28:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 307 [2025-03-04 11:28:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,373 INFO L225 Difference]: With dead ends: 232 [2025-03-04 11:28:27,373 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 11:28:27,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 601 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:27,374 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:27,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 154 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 11:28:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2025-03-04 11:28:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 84 states have internal predecessors, (89), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-04 11:28:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-03-04 11:28:27,384 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 307 [2025-03-04 11:28:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,384 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-03-04 11:28:27,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 11:28:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-03-04 11:28:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-04 11:28:27,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,388 INFO L218 NwaCegarLoop]: trace histogram [63, 59, 51, 32, 32, 32, 32, 30, 30, 30, 30, 30, 29, 29, 29, 28, 19, 12, 1, 1, 1, 1, 1] [2025-03-04 11:28:27,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:27,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:28:27,589 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:27,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -634311118, now seen corresponding path program 9 times [2025-03-04 11:28:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864237804] [2025-03-04 11:28:27,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-04 11:28:27,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-04 11:28:27,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-04 11:28:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 1063 refuted. 0 times theorem prover too weak. 8201 trivial. 0 not checked. [2025-03-04 11:28:29,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864237804] [2025-03-04 11:28:29,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864237804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940187651] [2025-03-04 11:28:29,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:29,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:29,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:29,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:29,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:28:29,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-04 11:28:29,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-04 11:28:29,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-04 11:28:29,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 11:28:29,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 797 refuted. 0 times theorem prover too weak. 8467 trivial. 0 not checked. [2025-03-04 11:28:29,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 4033 proven. 736 refuted. 0 times theorem prover too weak. 8280 trivial. 0 not checked. [2025-03-04 11:28:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940187651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:33,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 26] total 45 [2025-03-04 11:28:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117467670] [2025-03-04 11:28:33,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 11:28:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 11:28:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:28:33,978 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-04 11:28:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,254 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2025-03-04 11:28:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 11:28:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) Word has length 602 [2025-03-04 11:28:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,256 INFO L225 Difference]: With dead ends: 171 [2025-03-04 11:28:34,256 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 11:28:34,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1186 SyntacticMatches, 41 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=2316, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:28:34,258 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 11:28:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2025-03-04 11:28:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 112 states have internal predecessors, (117), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-04 11:28:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2025-03-04 11:28:34,278 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 602 [2025-03-04 11:28:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,279 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2025-03-04 11:28:34,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-04 11:28:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2025-03-04 11:28:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-03-04 11:28:34,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,287 INFO L218 NwaCegarLoop]: trace histogram [121, 117, 98, 61, 61, 61, 61, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1, 1] [2025-03-04 11:28:34,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:34,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:28:34,491 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash 53326905, now seen corresponding path program 10 times [2025-03-04 11:28:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44726044] [2025-03-04 11:28:34,492 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-04 11:28:34,559 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 695 of 1171 statements. [2025-03-04 11:28:34,560 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1242 proven. 7557 refuted. 0 times theorem prover too weak. 41339 trivial. 0 not checked. [2025-03-04 11:28:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44726044] [2025-03-04 11:28:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44726044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930661500] [2025-03-04 11:28:35,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:35,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,272 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:28:35,446 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-04 11:28:35,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 695 of 1171 statements. [2025-03-04 11:28:35,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 11:28:35,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:28:35,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 26148 proven. 2740 refuted. 0 times theorem prover too weak. 21250 trivial. 0 not checked. [2025-03-04 11:28:35,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1487 proven. 9176 refuted. 0 times theorem prover too weak. 39475 trivial. 0 not checked. [2025-03-04 11:28:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930661500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:37,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:37,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-03-04 11:28:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911555156] [2025-03-04 11:28:37,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:28:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:28:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:28:37,984 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-04 11:28:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:38,475 INFO L93 Difference]: Finished difference Result 353 states and 578 transitions. [2025-03-04 11:28:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:28:38,475 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 1171 [2025-03-04 11:28:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:38,477 INFO L225 Difference]: With dead ends: 353 [2025-03-04 11:28:38,477 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 11:28:38,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2394 GetRequests, 2325 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 11:28:38,482 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 183 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:38,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 177 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 11:28:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2025-03-04 11:28:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 152 states have internal predecessors, (161), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-04 11:28:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 274 transitions. [2025-03-04 11:28:38,498 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 274 transitions. Word has length 1171 [2025-03-04 11:28:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:38,499 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 274 transitions. [2025-03-04 11:28:38,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-04 11:28:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 274 transitions. [2025-03-04 11:28:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2025-03-04 11:28:38,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:38,508 INFO L218 NwaCegarLoop]: trace histogram [129, 127, 104, 64, 64, 64, 64, 64, 64, 64, 64, 64, 63, 63, 63, 62, 40, 25, 1, 1, 1, 1, 1] [2025-03-04 11:28:38,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:38,712 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash 478277947, now seen corresponding path program 11 times [2025-03-04 11:28:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53591451] [2025-03-04 11:28:38,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:38,734 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1257 statements into 91 equivalence classes. [2025-03-04 11:28:38,835 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) and asserted 795 of 1257 statements. [2025-03-04 11:28:38,835 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2025-03-04 11:28:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 57841 backedges. 5429 proven. 4076 refuted. 0 times theorem prover too weak. 48336 trivial. 0 not checked. [2025-03-04 11:28:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53591451] [2025-03-04 11:28:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53591451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872836565] [2025-03-04 11:28:39,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:28:39,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:39,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:39,595 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:28:39,778 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1257 statements into 91 equivalence classes. [2025-03-04 11:28:39,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) and asserted 795 of 1257 statements. [2025-03-04 11:28:39,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2025-03-04 11:28:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:39,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:28:39,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 57841 backedges. 29881 proven. 1171 refuted. 0 times theorem prover too weak. 26789 trivial. 0 not checked. [2025-03-04 11:28:40,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 57841 backedges. 5623 proven. 4356 refuted. 0 times theorem prover too weak. 47862 trivial. 0 not checked. [2025-03-04 11:28:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872836565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:42,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 21] total 28 [2025-03-04 11:28:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791972446] [2025-03-04 11:28:42,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 11:28:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:42,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 11:28:42,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:28:42,625 INFO L87 Difference]: Start difference. First operand 194 states and 274 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:28:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:42,997 INFO L93 Difference]: Finished difference Result 358 states and 541 transitions. [2025-03-04 11:28:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:28:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) Word has length 1257 [2025-03-04 11:28:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:42,999 INFO L225 Difference]: With dead ends: 358 [2025-03-04 11:28:43,000 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 11:28:43,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2554 GetRequests, 2499 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:28:43,002 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 136 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:43,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 196 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 11:28:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2025-03-04 11:28:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 108 states have internal predecessors, (113), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (44), 16 states have call predecessors, (44), 16 states have call successors, (44) [2025-03-04 11:28:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2025-03-04 11:28:43,014 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 1257 [2025-03-04 11:28:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2025-03-04 11:28:43,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 20 states have call successors, (27), 2 states have call predecessors, (27), 12 states have return successors, (33), 14 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-04 11:28:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2025-03-04 11:28:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-03-04 11:28:43,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:43,019 INFO L218 NwaCegarLoop]: trace histogram [84, 82, 68, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-03-04 11:28:43,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:28:43,219 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:43,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash -291664816, now seen corresponding path program 12 times [2025-03-04 11:28:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:43,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-03-04 11:28:43,220 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:43,235 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 817 statements into 60 equivalence classes. [2025-03-04 11:28:43,307 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) and asserted 743 of 817 statements. [2025-03-04 11:28:43,307 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2025-03-04 11:28:43,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 3204 proven. 2233 refuted. 0 times theorem prover too weak. 18778 trivial. 0 not checked. [2025-03-04 11:28:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-03-04 11:28:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416855494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49174701] [2025-03-04 11:28:43,960 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 11:28:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:43,962 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:43,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:28:44,126 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 817 statements into 60 equivalence classes. [2025-03-04 11:28:44,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) and asserted 743 of 817 statements. [2025-03-04 11:28:44,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2025-03-04 11:28:44,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:44,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:28:44,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 3188 proven. 2246 refuted. 0 times theorem prover too weak. 18781 trivial. 0 not checked. [2025-03-04 11:28:44,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24215 backedges. 3196 proven. 2310 refuted. 0 times theorem prover too weak. 18709 trivial. 0 not checked. [2025-03-04 11:28:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49174701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:45,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 25 [2025-03-04 11:28:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980275231] [2025-03-04 11:28:45,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:45,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:28:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:45,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:28:45,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:28:45,799 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 17 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-04 11:28:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:46,203 INFO L93 Difference]: Finished difference Result 384 states and 512 transitions. [2025-03-04 11:28:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 11:28:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 17 states have call predecessors, (27), 13 states have call successors, (27) Word has length 817 [2025-03-04 11:28:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:46,206 INFO L225 Difference]: With dead ends: 384 [2025-03-04 11:28:46,206 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 11:28:46,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1624 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=699, Invalid=1953, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 11:28:46,208 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 250 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:46,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 184 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 11:28:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 176. [2025-03-04 11:28:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.034965034965035) internal successors, (148), 139 states have internal predecessors, (148), 22 states have call successors, (22), 17 states have call predecessors, (22), 10 states have return successors, (57), 19 states have call predecessors, (57), 21 states have call successors, (57) [2025-03-04 11:28:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2025-03-04 11:28:46,221 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 817 [2025-03-04 11:28:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:46,221 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2025-03-04 11:28:46,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (27), 17 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-04 11:28:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2025-03-04 11:28:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2025-03-04 11:28:46,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:46,225 INFO L218 NwaCegarLoop]: trace histogram [73, 72, 59, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 23, 14, 1, 1, 1, 1, 1] [2025-03-04 11:28:46,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:46,425 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:46,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2103851211, now seen corresponding path program 13 times [2025-03-04 11:28:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255410771] [2025-03-04 11:28:46,426 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:46,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-03-04 11:28:46,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-03-04 11:28:46,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:46,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18379 backedges. 3018 proven. 1944 refuted. 0 times theorem prover too weak. 13417 trivial. 0 not checked. [2025-03-04 11:28:47,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:47,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255410771] [2025-03-04 11:28:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255410771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:47,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847265433] [2025-03-04 11:28:47,069 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 11:28:47,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:47,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:47,071 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:47,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:28:47,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-03-04 11:28:47,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-03-04 11:28:47,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:47,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:47,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 11:28:47,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18379 backedges. 8154 proven. 2667 refuted. 0 times theorem prover too weak. 7558 trivial. 0 not checked. [2025-03-04 11:28:47,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18379 backedges. 2231 proven. 4277 refuted. 0 times theorem prover too weak. 11871 trivial. 0 not checked. [2025-03-04 11:28:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847265433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:50,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:50,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 27] total 32 [2025-03-04 11:28:50,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223076206] [2025-03-04 11:28:50,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:50,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:28:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:50,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:28:50,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:28:50,011 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 26 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (44), 16 states have call predecessors, (44), 26 states have call successors, (44) [2025-03-04 11:28:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:50,359 INFO L93 Difference]: Finished difference Result 361 states and 481 transitions. [2025-03-04 11:28:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 11:28:50,360 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 26 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (44), 16 states have call predecessors, (44), 26 states have call successors, (44) Word has length 713 [2025-03-04 11:28:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:50,362 INFO L225 Difference]: With dead ends: 361 [2025-03-04 11:28:50,362 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 11:28:50,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1466 GetRequests, 1405 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:28:50,363 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:50,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 257 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 11:28:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2025-03-04 11:28:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.027972027972028) internal successors, (147), 140 states have internal predecessors, (147), 23 states have call successors, (23), 19 states have call predecessors, (23), 9 states have return successors, (49), 16 states have call predecessors, (49), 22 states have call successors, (49) [2025-03-04 11:28:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 219 transitions. [2025-03-04 11:28:50,375 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 219 transitions. Word has length 713 [2025-03-04 11:28:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:50,376 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 219 transitions. [2025-03-04 11:28:50,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 26 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (44), 16 states have call predecessors, (44), 26 states have call successors, (44) [2025-03-04 11:28:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 219 transitions. [2025-03-04 11:28:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-03-04 11:28:50,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:50,381 INFO L218 NwaCegarLoop]: trace histogram [94, 92, 76, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 45, 29, 18, 1, 1, 1, 1, 1] [2025-03-04 11:28:50,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:28:50,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:50,582 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:50,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2067215200, now seen corresponding path program 14 times [2025-03-04 11:28:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:50,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970722075] [2025-03-04 11:28:50,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:50,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 915 statements into 2 equivalence classes. [2025-03-04 11:28:50,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 915 of 915 statements. [2025-03-04 11:28:50,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:50,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30452 backedges. 3406 proven. 5088 refuted. 0 times theorem prover too weak. 21958 trivial. 0 not checked. [2025-03-04 11:28:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970722075] [2025-03-04 11:28:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970722075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061243084] [2025-03-04 11:28:51,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:51,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:51,712 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:28:51,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 915 statements into 2 equivalence classes. [2025-03-04 11:28:51,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 915 of 915 statements. [2025-03-04 11:28:51,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:51,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:51,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:28:52,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30452 backedges. 3844 proven. 5527 refuted. 0 times theorem prover too weak. 21081 trivial. 0 not checked. [2025-03-04 11:28:52,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30452 backedges. 3844 proven. 5699 refuted. 0 times theorem prover too weak. 20909 trivial. 0 not checked. [2025-03-04 11:28:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061243084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:55,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 11:28:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984154120] [2025-03-04 11:28:55,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:28:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:55,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:28:55,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:28:55,236 INFO L87 Difference]: Start difference. First operand 176 states and 219 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:55,628 INFO L93 Difference]: Finished difference Result 375 states and 485 transitions. [2025-03-04 11:28:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 11:28:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) Word has length 915 [2025-03-04 11:28:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:55,631 INFO L225 Difference]: With dead ends: 375 [2025-03-04 11:28:55,631 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:28:55,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1879 GetRequests, 1809 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=805, Invalid=2387, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 11:28:55,632 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 250 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:55,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 276 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:28:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2025-03-04 11:28:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 148 states have (on average 1.027027027027027) internal successors, (152), 145 states have internal predecessors, (152), 24 states have call successors, (24), 20 states have call predecessors, (24), 9 states have return successors, (51), 16 states have call predecessors, (51), 23 states have call successors, (51) [2025-03-04 11:28:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2025-03-04 11:28:55,644 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 915 [2025-03-04 11:28:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2025-03-04 11:28:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 29 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (44), 17 states have call predecessors, (44), 29 states have call successors, (44) [2025-03-04 11:28:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2025-03-04 11:28:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-03-04 11:28:55,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:55,653 INFO L218 NwaCegarLoop]: trace histogram [135, 134, 109, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 66, 42, 26, 1, 1, 1, 1, 1] [2025-03-04 11:28:55,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:55,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:55,854 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash 181535171, now seen corresponding path program 15 times [2025-03-04 11:28:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050850563] [2025-03-04 11:28:55,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:55,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1321 statements into 104 equivalence classes. [2025-03-04 11:28:55,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 715 of 1321 statements. [2025-03-04 11:28:55,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-04 11:28:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 4777 proven. 8123 refuted. 0 times theorem prover too weak. 51008 trivial. 0 not checked. [2025-03-04 11:28:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050850563] [2025-03-04 11:28:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050850563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:56,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034709263] [2025-03-04 11:28:56,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:56,861 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:56,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:28:57,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1321 statements into 104 equivalence classes. [2025-03-04 11:28:57,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 715 of 1321 statements. [2025-03-04 11:28:57,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-04 11:28:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:57,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 11:28:57,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 5076 proven. 8146 refuted. 0 times theorem prover too weak. 50686 trivial. 0 not checked. [2025-03-04 11:28:57,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 63908 backedges. 5076 proven. 8311 refuted. 0 times theorem prover too weak. 50521 trivial. 0 not checked. [2025-03-04 11:29:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034709263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:00,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:00,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 34 [2025-03-04 11:29:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471805125] [2025-03-04 11:29:00,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:00,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:29:00,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:00,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:29:00,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:29:00,506 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand has 34 states, 34 states have (on average 5.5) internal successors, (187), 34 states have internal predecessors, (187), 24 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 19 states have call predecessors, (40), 24 states have call successors, (40) [2025-03-04 11:29:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:01,029 INFO L93 Difference]: Finished difference Result 416 states and 560 transitions. [2025-03-04 11:29:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 11:29:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 34 states have internal predecessors, (187), 24 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 19 states have call predecessors, (40), 24 states have call successors, (40) Word has length 1321 [2025-03-04 11:29:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:01,033 INFO L225 Difference]: With dead ends: 416 [2025-03-04 11:29:01,033 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 11:29:01,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2706 GetRequests, 2627 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1108, Invalid=3314, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 11:29:01,036 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 659 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:01,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 191 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:29:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 11:29:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 167. [2025-03-04 11:29:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.0223880597014925) internal successors, (137), 133 states have internal predecessors, (137), 22 states have call successors, (22), 16 states have call predecessors, (22), 10 states have return successors, (56), 17 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-04 11:29:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 215 transitions. [2025-03-04 11:29:01,047 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 215 transitions. Word has length 1321 [2025-03-04 11:29:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:01,048 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 215 transitions. [2025-03-04 11:29:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.5) internal successors, (187), 34 states have internal predecessors, (187), 24 states have call successors, (31), 1 states have call predecessors, (31), 14 states have return successors, (40), 19 states have call predecessors, (40), 24 states have call successors, (40) [2025-03-04 11:29:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 215 transitions. [2025-03-04 11:29:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-04 11:29:01,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:01,053 INFO L218 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1, 1] [2025-03-04 11:29:01,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:29:01,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:01,258 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:01,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1653235746, now seen corresponding path program 16 times [2025-03-04 11:29:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:01,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866506580] [2025-03-04 11:29:01,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:01,275 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1066 statements into 2 equivalence classes. [2025-03-04 11:29:01,317 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-04 11:29:01,318 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:01,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6976 proven. 7865 refuted. 0 times theorem prover too weak. 26625 trivial. 0 not checked. [2025-03-04 11:29:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866506580] [2025-03-04 11:29:16,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866506580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229400267] [2025-03-04 11:29:16,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:29:16,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:16,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:16,697 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:16,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:29:16,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1066 statements into 2 equivalence classes. [2025-03-04 11:29:17,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-04 11:29:17,061 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:29:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:17,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 11:29:17,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-03-04 11:29:17,770 INFO L312 TraceCheckSpWp]: Computing backward predicates...