./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-numeric/Fibonacci01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 86ba16bc10375ac42edefcd6943a10cb01d22e743b7024fc57762abf0f29fc40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:53,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:53,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:53,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:53,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:53,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:53,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:53,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:53,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:53,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:53,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:53,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:53,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:53,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:53,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:53,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:53,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:53,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:53,562 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86ba16bc10375ac42edefcd6943a10cb01d22e743b7024fc57762abf0f29fc40 [2025-03-04 10:32:53,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:53,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:53,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:53,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:53,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:53,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2025-03-04 10:32:54,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0064f736c/b95e54b9deb746d8aabc8b742f8b7915/FLAGe6d584bd0 [2025-03-04 10:32:55,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:55,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2025-03-04 10:32:55,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0064f736c/b95e54b9deb746d8aabc8b742f8b7915/FLAGe6d584bd0 [2025-03-04 10:32:55,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0064f736c/b95e54b9deb746d8aabc8b742f8b7915 [2025-03-04 10:32:55,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:55,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:55,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:55,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:55,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:55,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b58d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55, skipping insertion in model container [2025-03-04 10:32:55,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:55,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:55,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:55,617 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:55,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55 WrapperNode [2025-03-04 10:32:55,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:55,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:55,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:55,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:55,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,640 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2025-03-04 10:32:55,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:55,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:55,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:55,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:55,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,653 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 10:32:55,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:55,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:55,662 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:55,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:55,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (1/1) ... [2025-03-04 10:32:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:55,692 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 10:32:55,696 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 10:32:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-04 10:32:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-04 10:32:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:32:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:55,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:32:55,755 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:55,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:55,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-04 10:32:55,884 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:55,884 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:55,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:55,896 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:55,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:55 BoogieIcfgContainer [2025-03-04 10:32:55,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:55,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:55,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:55,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:55,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:55" (1/3) ... [2025-03-04 10:32:55,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e095e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:55, skipping insertion in model container [2025-03-04 10:32:55,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:55" (2/3) ... [2025-03-04 10:32:55,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e095e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:55, skipping insertion in model container [2025-03-04 10:32:55,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:55" (3/3) ... [2025-03-04 10:32:55,907 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-2.c [2025-03-04 10:32:55,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:55,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-2.c that has 2 procedures, 33 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 10:32:55,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:55,974 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;@429ab9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:55,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:32:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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 10:32:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:55,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:55,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:55,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1524396915, now seen corresponding path program 1 times [2025-03-04 10:32:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716210958] [2025-03-04 10:32:55,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:56,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:56,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,140 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 10:32:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716210958] [2025-03-04 10:32:56,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716210958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:56,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935634209] [2025-03-04 10:32:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:56,167 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 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 4.0) internal successors, (8), 3 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 10:32:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,209 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-04 10:32:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 10:32:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,216 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:32:56,216 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:32:56,219 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 10:32:56,221 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 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 10:32:56,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:32:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-04 10:32:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 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 10:32:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-04 10:32:56,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2025-03-04 10:32:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,253 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-04 10:32:56,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 10:32:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-04 10:32:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:32:56,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:56,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -11664124, now seen corresponding path program 1 times [2025-03-04 10:32:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153978528] [2025-03-04 10:32:56,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:32:56,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:32:56,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,323 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 10:32:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153978528] [2025-03-04 10:32:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153978528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:56,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:56,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:56,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448694305] [2025-03-04 10:32:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:56,326 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:32:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,385 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-03-04 10:32:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-03-04 10:32:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,386 INFO L225 Difference]: With dead ends: 26 [2025-03-04 10:32:56,386 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:32:56,386 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 10:32:56,387 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:56,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:32:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 10:32:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 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 10:32:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-04 10:32:56,395 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2025-03-04 10:32:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-04 10:32:56,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10:32:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-04 10:32:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:32:56,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,396 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 10:32:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:56,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -11803775, now seen corresponding path program 1 times [2025-03-04 10:32:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712754318] [2025-03-04 10:32:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:32:56,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:32:56,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,516 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 10:32:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712754318] [2025-03-04 10:32:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712754318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983017810] [2025-03-04 10:32:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:56,518 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 10:32:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:56,564 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-03-04 10:32:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 25 [2025-03-04 10:32:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:56,566 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:32:56,566 INFO L226 Difference]: Without dead ends: 34 [2025-03-04 10:32:56,567 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 10:32:56,568 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:56,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-04 10:32:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2025-03-04 10:32:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 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 10:32:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 10:32:56,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 25 [2025-03-04 10:32:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:56,578 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 10:32:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 10:32:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-04 10:32:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:32:56,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:56,579 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, 1] [2025-03-04 10:32:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:56,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1437883784, now seen corresponding path program 1 times [2025-03-04 10:32:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601563003] [2025-03-04 10:32:56,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:56,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:32:56,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:56,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,710 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 10:32:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601563003] [2025-03-04 10:32:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601563003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015269465] [2025-03-04 10:32:56,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:56,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:56,713 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 10:32:56,715 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 10:32:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:32:56,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:56,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:56,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:56,863 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 10:32:56,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:57,003 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 10:32:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015269465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:57,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-04 10:32:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890947033] [2025-03-04 10:32:57,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:57,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:32:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:57,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:32:57,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:32:57,005 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 10:32:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:57,227 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2025-03-04 10:32:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:32:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 32 [2025-03-04 10:32:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:57,228 INFO L225 Difference]: With dead ends: 92 [2025-03-04 10:32:57,228 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 10:32:57,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 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 10:32:57,231 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:57,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 110 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 10:32:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2025-03-04 10:32:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.1) internal successors, (44), 43 states have internal predecessors, (44), 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 10:32:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-04 10:32:57,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 32 [2025-03-04 10:32:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:57,245 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-04 10:32:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 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 10:32:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-04 10:32:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:32:57,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:57,247 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, 1] [2025-03-04 10:32:57,253 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 10:32:57,447 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 10:32:57,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:57,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash -72436654, now seen corresponding path program 2 times [2025-03-04 10:32:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216787630] [2025-03-04 10:32:57,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:57,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:32:57,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:57,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:57,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:57,564 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 10:32:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216787630] [2025-03-04 10:32:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216787630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658021251] [2025-03-04 10:32:57,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:57,567 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 10:32:57,568 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 10:32:57,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:32:57,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:57,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:57,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:57,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:57,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:32:57,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658021251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 10:32:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955919456] [2025-03-04 10:32:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:57,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:57,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:57,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:57,653 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 10:32:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:57,684 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-03-04 10:32:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 32 [2025-03-04 10:32:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:57,688 INFO L225 Difference]: With dead ends: 61 [2025-03-04 10:32:57,688 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 10:32:57,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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 10:32:57,689 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 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 10:32:57,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 10:32:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-03-04 10:32:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 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 10:32:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-03-04 10:32:57,696 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 32 [2025-03-04 10:32:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-03-04 10:32:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 10:32:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-03-04 10:32:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 10:32:57,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:57,697 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, 1, 1] [2025-03-04 10:32:57,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:32:57,897 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 10:32:57,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2049430995, now seen corresponding path program 1 times [2025-03-04 10:32:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336983465] [2025-03-04 10:32:57,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:57,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:32:57,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:57,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:57,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:57,984 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 10:32:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336983465] [2025-03-04 10:32:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336983465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017276469] [2025-03-04 10:32:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:57,987 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 10:32:57,988 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 10:32:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:32:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:32:58,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:32:58,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 10:32:58,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:32:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017276469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:58,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:32:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:32:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828611450] [2025-03-04 10:32:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:32:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:58,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:32:58,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:58,099 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 10:32:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:58,126 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2025-03-04 10:32:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:32:58,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 33 [2025-03-04 10:32:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:58,128 INFO L225 Difference]: With dead ends: 83 [2025-03-04 10:32:58,128 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 10:32:58,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:58,129 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:58,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 10:32:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2025-03-04 10:32:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 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 10:32:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2025-03-04 10:32:58,145 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 33 [2025-03-04 10:32:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2025-03-04 10:32:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 10:32:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2025-03-04 10:32:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:32:58,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:58,146 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:58,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:32:58,346 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 10:32:58,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 502266677, now seen corresponding path program 1 times [2025-03-04 10:32:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169333987] [2025-03-04 10:32:58,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:58,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:32:58,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:32:58,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 10:32:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169333987] [2025-03-04 10:32:58,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169333987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038729365] [2025-03-04 10:32:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:58,508 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 10:32:58,514 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 10:32:58,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:32:58,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:32:58,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:58,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:58,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:32:58,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-04 10:32:58,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:32:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038729365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:58,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-04 10:32:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848979580] [2025-03-04 10:32:58,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:58,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:58,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:58,817 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 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 10:32:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:58,982 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2025-03-04 10:32:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:32:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 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 47 [2025-03-04 10:32:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:58,989 INFO L225 Difference]: With dead ends: 142 [2025-03-04 10:32:58,990 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 10:32:58,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:58,991 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:58,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 10:32:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2025-03-04 10:32:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.077922077922078) internal successors, (83), 76 states have internal predecessors, (83), 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 10:32:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 160 transitions. [2025-03-04 10:32:59,014 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 160 transitions. Word has length 47 [2025-03-04 10:32:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,015 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 160 transitions. [2025-03-04 10:32:59,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 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 10:32:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2025-03-04 10:32:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:32:59,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,017 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:32:59,222 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 10:32:59,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1954339160, now seen corresponding path program 1 times [2025-03-04 10:32:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491237781] [2025-03-04 10:32:59,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:32:59,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:32:59,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:32:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491237781] [2025-03-04 10:32:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491237781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767759352] [2025-03-04 10:32:59,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:59,402 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 10:32:59,410 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 10:32:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:32:59,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:32:59,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:32:59,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 10:32:59,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 10:32:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767759352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:59,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 18 [2025-03-04 10:32:59,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522258357] [2025-03-04 10:32:59,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:32:59,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:32:59,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:32:59,732 INFO L87 Difference]: Start difference. First operand 99 states and 160 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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 10:33:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,205 INFO L93 Difference]: Finished difference Result 258 states and 505 transitions. [2025-03-04 10:33:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:33:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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 70 [2025-03-04 10:33:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,209 INFO L225 Difference]: With dead ends: 258 [2025-03-04 10:33:00,209 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 10:33:00,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 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 10:33:00,217 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 94 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 85 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 10:33:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2025-03-04 10:33:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 10:33:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 172 transitions. [2025-03-04 10:33:00,248 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 172 transitions. Word has length 70 [2025-03-04 10:33:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 172 transitions. [2025-03-04 10:33:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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 10:33:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 172 transitions. [2025-03-04 10:33:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 10:33:00,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,254 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:33:00,454 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 10:33:00,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 624222528, now seen corresponding path program 2 times [2025-03-04 10:33:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881240454] [2025-03-04 10:33:00,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-04 10:33:00,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:33:00,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:00,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 30 proven. 126 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-04 10:33:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881240454] [2025-03-04 10:33:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881240454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790218435] [2025-03-04 10:33:00,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,565 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 10:33:00,567 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 10:33:00,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-04 10:33:00,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:33:00,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-04 10:33:00,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-04 10:33:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790218435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-04 10:33:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390543057] [2025-03-04 10:33:01,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:33:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:33:01,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:01,026 INFO L87 Difference]: Start difference. First operand 104 states and 172 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 10:33:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:01,110 INFO L93 Difference]: Finished difference Result 163 states and 279 transitions. [2025-03-04 10:33:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 124 [2025-03-04 10:33:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:01,112 INFO L225 Difference]: With dead ends: 163 [2025-03-04 10:33:01,112 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 10:33:01,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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 10:33:01,113 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:01,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 94 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 10:33:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 10:33:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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 10:33:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-04 10:33:01,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 124 [2025-03-04 10:33:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:01,124 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-04 10:33:01,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 10:33:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-04 10:33:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 10:33:01,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:01,126 INFO L218 NwaCegarLoop]: trace histogram [20, 17, 16, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:01,135 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 10:33:01,330 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 10:33:01,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1750796034, now seen corresponding path program 3 times [2025-03-04 10:33:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150516073] [2025-03-04 10:33:01,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:01,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 17 equivalence classes. [2025-03-04 10:33:01,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 72 of 185 statements. [2025-03-04 10:33:01,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 332 proven. 18 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-04 10:33:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150516073] [2025-03-04 10:33:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150516073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791004626] [2025-03-04 10:33:01,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:01,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:01,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:01,443 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 10:33:01,444 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 10:33:01,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 17 equivalence classes. [2025-03-04 10:33:01,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 72 of 185 statements. [2025-03-04 10:33:01,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:01,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:01,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 328 proven. 20 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2025-03-04 10:33:01,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 328 proven. 22 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-04 10:33:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791004626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-04 10:33:01,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475489809] [2025-03-04 10:33:01,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:33:01,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:33:01,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:01,873 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 10:33:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:01,969 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2025-03-04 10:33:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:33:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 185 [2025-03-04 10:33:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:01,971 INFO L225 Difference]: With dead ends: 125 [2025-03-04 10:33:01,971 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 10:33:01,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 363 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:01,972 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:01,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 10:33:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 10:33:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 51 states have internal predecessors, (56), 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 10:33:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-04 10:33:01,983 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 185 [2025-03-04 10:33:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:01,984 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-04 10:33:01,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 10:33:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-04 10:33:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 10:33:01,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:01,986 INFO L218 NwaCegarLoop]: trace histogram [20, 17, 15, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:01,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:02,187 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 10:33:02,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:02,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -161715029, now seen corresponding path program 4 times [2025-03-04 10:33:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237457332] [2025-03-04 10:33:02,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:02,201 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-04 10:33:02,211 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 110 of 184 statements. [2025-03-04 10:33:02,212 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:02,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 112 proven. 280 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2025-03-04 10:33:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237457332] [2025-03-04 10:33:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237457332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492816944] [2025-03-04 10:33:02,322 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:02,324 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 10:33:02,326 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 10:33:02,361 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 184 statements into 2 equivalence classes. [2025-03-04 10:33:02,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 110 of 184 statements. [2025-03-04 10:33:02,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:02,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:02,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:02,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 516 proven. 15 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-03-04 10:33:02,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 115 proven. 331 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-04 10:33:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492816944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:02,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-04 10:33:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730939412] [2025-03-04 10:33:02,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:33:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:02,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:33:02,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:33:02,711 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 10:33:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,779 INFO L93 Difference]: Finished difference Result 120 states and 160 transitions. [2025-03-04 10:33:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 184 [2025-03-04 10:33:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,780 INFO L225 Difference]: With dead ends: 120 [2025-03-04 10:33:02,780 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 10:33:02,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 360 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:02,781 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 10:33:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-03-04 10:33:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 10:33:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-03-04 10:33:02,788 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 184 [2025-03-04 10:33:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:02,788 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-03-04 10:33:02,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 7 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 10:33:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-03-04 10:33:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:33:02,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:02,790 INFO L218 NwaCegarLoop]: trace histogram [17, 15, 14, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:02,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:33:02,994 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 10:33:02,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash -80343455, now seen corresponding path program 5 times [2025-03-04 10:33:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230065651] [2025-03-04 10:33:02,994 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:03,000 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 160 statements into 14 equivalence classes. [2025-03-04 10:33:03,012 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 102 of 160 statements. [2025-03-04 10:33:03,012 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 10:33:03,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 133 proven. 250 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2025-03-04 10:33:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230065651] [2025-03-04 10:33:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230065651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377553118] [2025-03-04 10:33:03,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:03,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:03,184 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 10:33:03,185 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 10:33:03,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 160 statements into 14 equivalence classes. [2025-03-04 10:33:03,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 102 of 160 statements. [2025-03-04 10:33:03,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 10:33:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:03,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 511 proven. 116 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 10:33:03,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 157 proven. 271 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-04 10:33:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377553118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:03,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 23 [2025-03-04 10:33:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350707418] [2025-03-04 10:33:03,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:03,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:33:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:33:03,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:33:03,627 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 23 states, 23 states have (on average 5.173913043478261) internal successors, (119), 22 states have internal predecessors, (119), 12 states have call successors, (21), 4 states have call predecessors, (21), 8 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 10:33:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:03,920 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2025-03-04 10:33:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:33:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.173913043478261) internal successors, (119), 22 states have internal predecessors, (119), 12 states have call successors, (21), 4 states have call predecessors, (21), 8 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Word has length 160 [2025-03-04 10:33:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:03,922 INFO L225 Difference]: With dead ends: 138 [2025-03-04 10:33:03,922 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 10:33:03,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:33:03,924 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 208 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:03,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 142 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 10:33:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2025-03-04 10:33:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.096774193548387) internal successors, (68), 61 states have internal predecessors, (68), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 10:33:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-03-04 10:33:03,932 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 160 [2025-03-04 10:33:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-03-04 10:33:03,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.173913043478261) internal successors, (119), 22 states have internal predecessors, (119), 12 states have call successors, (21), 4 states have call predecessors, (21), 8 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 10:33:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-03-04 10:33:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 10:33:03,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:03,934 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, 1] [2025-03-04 10:33:03,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:04,135 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 10:33:04,135 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:04,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1887722427, now seen corresponding path program 6 times [2025-03-04 10:33:04,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:04,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458791396] [2025-03-04 10:33:04,137 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:04,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 125 statements into 9 equivalence classes. [2025-03-04 10:33:04,158 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:33:04,158 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-04 10:33:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 165 proven. 132 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 10:33:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458791396] [2025-03-04 10:33:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458791396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413273739] [2025-03-04 10:33:04,294 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:04,296 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 10:33:04,297 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 10:33:04,329 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 125 statements into 9 equivalence classes. [2025-03-04 10:33:04,350 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:33:04,351 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-04 10:33:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:04,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 163 proven. 137 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-04 10:33:04,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 167 proven. 142 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-04 10:33:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413273739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:04,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 17 [2025-03-04 10:33:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270109333] [2025-03-04 10:33:04,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:04,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:04,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:04,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:04,793 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-04 10:33:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:04,949 INFO L93 Difference]: Finished difference Result 160 states and 203 transitions. [2025-03-04 10:33:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:33:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) Word has length 125 [2025-03-04 10:33:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:04,951 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:33:04,951 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 10:33:04,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 241 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:04,952 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:04,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 153 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 10:33:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2025-03-04 10:33:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-04 10:33:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-03-04 10:33:04,959 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 125 [2025-03-04 10:33:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:04,959 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-04 10:33:04,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-04 10:33:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-03-04 10:33:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 10:33:04,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:04,960 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 13, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:04,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:33:05,161 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 10:33:05,161 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1420830941, now seen corresponding path program 7 times [2025-03-04 10:33:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760732643] [2025-03-04 10:33:05,162 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:05,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 10:33:05,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 10:33:05,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 78 proven. 189 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-03-04 10:33:05,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:05,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760732643] [2025-03-04 10:33:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760732643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:05,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839973614] [2025-03-04 10:33:05,487 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:05,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:05,492 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 10:33:05,494 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 10:33:05,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 10:33:05,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 10:33:05,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:33:05,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 78 proven. 135 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2025-03-04 10:33:05,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 144 proven. 128 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-04 10:33:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839973614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:06,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 31 [2025-03-04 10:33:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573889632] [2025-03-04 10:33:06,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:33:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:33:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:33:06,569 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 32 states have internal predecessors, (86), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-04 10:33:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:06,691 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2025-03-04 10:33:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:33:06,691 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 32 states have internal predecessors, (86), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) Word has length 151 [2025-03-04 10:33:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:06,693 INFO L225 Difference]: With dead ends: 112 [2025-03-04 10:33:06,693 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 10:33:06,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 286 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:06,694 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:06,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 10:33:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-03-04 10:33:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 80 states have internal predecessors, (85), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (34), 14 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 10:33:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2025-03-04 10:33:06,701 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 151 [2025-03-04 10:33:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:06,702 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2025-03-04 10:33:06,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.774193548387097) internal successors, (86), 32 states have internal predecessors, (86), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (21), 21 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-04 10:33:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2025-03-04 10:33:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 10:33:06,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:06,706 INFO L218 NwaCegarLoop]: trace histogram [47, 45, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:06,712 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 10:33:06,910 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 10:33:06,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 755214911, now seen corresponding path program 8 times [2025-03-04 10:33:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154608679] [2025-03-04 10:33:06,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:06,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 454 statements into 2 equivalence classes. [2025-03-04 10:33:06,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 10:33:06,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:06,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 558 proven. 2001 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2025-03-04 10:33:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154608679] [2025-03-04 10:33:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154608679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954744542] [2025-03-04 10:33:07,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:07,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:07,410 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 10:33:07,414 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 10:33:07,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 454 statements into 2 equivalence classes. [2025-03-04 10:33:07,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 10:33:07,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:33:07,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 3859 proven. 1245 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2025-03-04 10:33:07,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 658 proven. 2493 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2025-03-04 10:33:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954744542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:09,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 27 [2025-03-04 10:33:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638289637] [2025-03-04 10:33:09,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:09,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:33:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:09,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:33:09,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:09,146 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-04 10:33:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:09,531 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2025-03-04 10:33:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:33:09,531 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) Word has length 454 [2025-03-04 10:33:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:09,533 INFO L225 Difference]: With dead ends: 240 [2025-03-04 10:33:09,533 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 10:33:09,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 893 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=1667, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:33:09,537 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 233 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:09,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 170 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 10:33:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2025-03-04 10:33:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 101 states have internal predecessors, (110), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (37), 17 states have call predecessors, (37), 14 states have call successors, (37) [2025-03-04 10:33:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2025-03-04 10:33:09,549 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 454 [2025-03-04 10:33:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2025-03-04 10:33:09,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.074074074074074) internal successors, (164), 27 states have internal predecessors, (164), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-04 10:33:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2025-03-04 10:33:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-04 10:33:09,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:09,552 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, 1] [2025-03-04 10:33:09,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:33:09,753 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 10:33:09,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1377955146, now seen corresponding path program 9 times [2025-03-04 10:33:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454923570] [2025-03-04 10:33:09,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:09,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 308 statements into 21 equivalence classes. [2025-03-04 10:33:09,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 294 of 308 statements. [2025-03-04 10:33:09,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-04 10:33:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 583 proven. 525 refuted. 0 times theorem prover too weak. 2174 trivial. 0 not checked. [2025-03-04 10:33:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454923570] [2025-03-04 10:33:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454923570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689732931] [2025-03-04 10:33:10,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:10,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:10,078 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 10:33:10,087 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 10:33:10,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 308 statements into 21 equivalence classes. [2025-03-04 10:33:10,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) and asserted 294 of 308 statements. [2025-03-04 10:33:10,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2025-03-04 10:33:10,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:10,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:10,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 1890 proven. 173 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-04 10:33:10,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 583 proven. 538 refuted. 0 times theorem prover too weak. 2161 trivial. 0 not checked. [2025-03-04 10:33:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689732931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:10,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-04 10:33:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12922027] [2025-03-04 10:33:10,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:33:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:33:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:33:10,840 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 8 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 11 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-04 10:33:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:11,007 INFO L93 Difference]: Finished difference Result 238 states and 304 transitions. [2025-03-04 10:33:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:33:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 8 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 11 states have call predecessors, (19), 8 states have call successors, (19) Word has length 308 [2025-03-04 10:33:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:11,009 INFO L225 Difference]: With dead ends: 238 [2025-03-04 10:33:11,009 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 10:33:11,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 609 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:11,010 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:11,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 131 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 10:33:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-03-04 10:33:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 82 states have internal predecessors, (90), 12 states have call successors, (12), 10 states have call predecessors, (12), 7 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-04 10:33:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2025-03-04 10:33:11,016 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 308 [2025-03-04 10:33:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:11,016 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2025-03-04 10:33:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 8 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (19), 11 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-04 10:33:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2025-03-04 10:33:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-04 10:33:11,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:11,020 INFO L218 NwaCegarLoop]: trace histogram [61, 59, 49, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 28, 19, 12, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:11,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:33:11,221 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 10:33:11,221 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 977596412, now seen corresponding path program 10 times [2025-03-04 10:33:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498599032] [2025-03-04 10:33:11,222 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:11,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 591 statements into 2 equivalence classes. [2025-03-04 10:33:11,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 351 of 591 statements. [2025-03-04 10:33:11,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 1232 proven. 2640 refuted. 0 times theorem prover too weak. 8649 trivial. 0 not checked. [2025-03-04 10:33:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498599032] [2025-03-04 10:33:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498599032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082310661] [2025-03-04 10:33:11,557 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:11,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:11,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:11,559 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 10:33:11,560 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 10:33:11,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 591 statements into 2 equivalence classes. [2025-03-04 10:33:11,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 351 of 591 statements. [2025-03-04 10:33:11,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:33:11,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 4518 proven. 2732 refuted. 0 times theorem prover too weak. 5271 trivial. 0 not checked. [2025-03-04 10:33:11,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 1400 proven. 3669 refuted. 0 times theorem prover too weak. 7452 trivial. 0 not checked. [2025-03-04 10:33:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082310661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:13,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:13,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 26] total 31 [2025-03-04 10:33:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840430966] [2025-03-04 10:33:13,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:13,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:33:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:13,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:33:13,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:33:13,493 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 26 states have call successors, (34), 3 states have call predecessors, (34), 13 states have return successors, (42), 16 states have call predecessors, (42), 25 states have call successors, (42) [2025-03-04 10:33:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:13,879 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2025-03-04 10:33:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:33:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 26 states have call successors, (34), 3 states have call predecessors, (34), 13 states have return successors, (42), 16 states have call predecessors, (42), 25 states have call successors, (42) Word has length 591 [2025-03-04 10:33:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:13,880 INFO L225 Difference]: With dead ends: 255 [2025-03-04 10:33:13,881 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 10:33:13,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1234 GetRequests, 1163 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=2561, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 10:33:13,882 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 239 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:13,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 214 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 10:33:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2025-03-04 10:33:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.0535714285714286) internal successors, (118), 109 states have internal predecessors, (118), 17 states have call successors, (17), 14 states have call predecessors, (17), 8 states have return successors, (33), 14 states have call predecessors, (33), 16 states have call successors, (33) [2025-03-04 10:33:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2025-03-04 10:33:13,890 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 591 [2025-03-04 10:33:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:13,892 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2025-03-04 10:33:13,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 26 states have call successors, (34), 3 states have call predecessors, (34), 13 states have return successors, (42), 16 states have call predecessors, (42), 25 states have call successors, (42) [2025-03-04 10:33:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2025-03-04 10:33:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 10:33:13,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:13,894 INFO L218 NwaCegarLoop]: trace histogram [35, 34, 28, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 11, 7, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:13,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:33:14,094 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 10:33:14,094 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -744891789, now seen corresponding path program 11 times [2025-03-04 10:33:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446790801] [2025-03-04 10:33:14,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:14,101 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 341 statements into 24 equivalence classes. [2025-03-04 10:33:14,123 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 298 of 341 statements. [2025-03-04 10:33:14,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 10:33:14,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 743 proven. 1095 refuted. 0 times theorem prover too weak. 2212 trivial. 0 not checked. [2025-03-04 10:33:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446790801] [2025-03-04 10:33:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446790801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674105345] [2025-03-04 10:33:14,366 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:14,368 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 10:33:14,370 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 10:33:14,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 341 statements into 24 equivalence classes. [2025-03-04 10:33:14,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 298 of 341 statements. [2025-03-04 10:33:14,490 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-04 10:33:14,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:14,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:33:14,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 737 proven. 1171 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2025-03-04 10:33:14,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 737 proven. 1235 refuted. 0 times theorem prover too weak. 2078 trivial. 0 not checked. [2025-03-04 10:33:15,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674105345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:15,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:15,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 26 [2025-03-04 10:33:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861678921] [2025-03-04 10:33:15,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:15,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:33:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:15,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:33:15,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:33:15,624 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 13 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 10:33:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:15,905 INFO L93 Difference]: Finished difference Result 287 states and 372 transitions. [2025-03-04 10:33:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:33:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 13 states have call predecessors, (28), 18 states have call successors, (28) Word has length 341 [2025-03-04 10:33:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:15,908 INFO L225 Difference]: With dead ends: 287 [2025-03-04 10:33:15,908 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 10:33:15,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 668 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=487, Invalid=1319, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:33:15,909 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:15,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 232 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 10:33:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2025-03-04 10:33:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 100 states have internal predecessors, (104), 16 states have call successors, (16), 12 states have call predecessors, (16), 8 states have return successors, (35), 13 states have call predecessors, (35), 15 states have call successors, (35) [2025-03-04 10:33:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2025-03-04 10:33:15,917 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 341 [2025-03-04 10:33:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2025-03-04 10:33:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (28), 13 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-04 10:33:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2025-03-04 10:33:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 10:33:15,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:15,920 INFO L218 NwaCegarLoop]: trace histogram [42, 40, 34, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 13, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:15,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:33:16,125 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 10:33:16,125 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 839494376, now seen corresponding path program 12 times [2025-03-04 10:33:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234692845] [2025-03-04 10:33:16,126 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:16,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:16,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 406 statements into 30 equivalence classes. [2025-03-04 10:33:16,188 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 10:33:16,189 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2025-03-04 10:33:16,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 878 proven. 1478 refuted. 0 times theorem prover too weak. 3447 trivial. 0 not checked. [2025-03-04 10:33:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234692845] [2025-03-04 10:33:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234692845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:17,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104963960] [2025-03-04 10:33:17,894 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:17,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:17,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:17,896 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 10:33:17,898 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 10:33:17,977 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 406 statements into 30 equivalence classes. [2025-03-04 10:33:18,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 10:33:18,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2025-03-04 10:33:18,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:18,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 10:33:18,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 820 proven. 1112 refuted. 0 times theorem prover too weak. 3871 trivial. 0 not checked. [2025-03-04 10:33:18,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5803 backedges. 1149 proven. 1015 refuted. 0 times theorem prover too weak. 3639 trivial. 0 not checked. [2025-03-04 10:33:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104963960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:23,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:23,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 29] total 46 [2025-03-04 10:33:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691154074] [2025-03-04 10:33:23,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-04 10:33:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:23,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-04 10:33:23,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 10:33:23,923 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-04 10:33:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:24,069 INFO L93 Difference]: Finished difference Result 157 states and 209 transitions. [2025-03-04 10:33:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:33:24,070 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) Word has length 406 [2025-03-04 10:33:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:24,071 INFO L225 Difference]: With dead ends: 157 [2025-03-04 10:33:24,071 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 10:33:24,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 795 SyntacticMatches, 51 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1972, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 10:33:24,072 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:24,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 239 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 10:33:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2025-03-04 10:33:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 118 states have (on average 1.0254237288135593) internal successors, (121), 116 states have internal predecessors, (121), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (55), 18 states have call predecessors, (55), 17 states have call successors, (55) [2025-03-04 10:33:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 194 transitions. [2025-03-04 10:33:24,080 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 194 transitions. Word has length 406 [2025-03-04 10:33:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:24,081 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 194 transitions. [2025-03-04 10:33:24,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.6739130434782608) internal successors, (123), 47 states have internal predecessors, (123), 12 states have call successors, (13), 1 states have call predecessors, (13), 13 states have return successors, (32), 32 states have call predecessors, (32), 12 states have call successors, (32) [2025-03-04 10:33:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 194 transitions. [2025-03-04 10:33:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1232 [2025-03-04 10:33:24,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:24,088 INFO L218 NwaCegarLoop]: trace histogram [127, 123, 103, 64, 64, 64, 64, 62, 62, 62, 62, 62, 61, 61, 61, 60, 39, 24, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:24,096 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 10:33:24,289 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 10:33:24,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:24,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -770083260, now seen corresponding path program 13 times [2025-03-04 10:33:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17238070] [2025-03-04 10:33:24,290 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:24,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1231 statements into 1 equivalence classes. [2025-03-04 10:33:24,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1231 of 1231 statements. [2025-03-04 10:33:24,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55363 backedges. 2173 proven. 8529 refuted. 0 times theorem prover too weak. 44661 trivial. 0 not checked. [2025-03-04 10:33:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17238070] [2025-03-04 10:33:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17238070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594463985] [2025-03-04 10:33:26,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:26,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:26,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:26,258 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 10:33:26,259 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 10:33:26,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1231 statements into 1 equivalence classes. [2025-03-04 10:33:26,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1231 of 1231 statements. [2025-03-04 10:33:26,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:26,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:26,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 2291 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:33:26,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55363 backedges. 26985 proven. 5516 refuted. 0 times theorem prover too weak. 22862 trivial. 0 not checked. [2025-03-04 10:33:26,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 55363 backedges. 2639 proven. 10022 refuted. 0 times theorem prover too weak. 42702 trivial. 0 not checked. [2025-03-04 10:33:29,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594463985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:29,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:29,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 28] total 33 [2025-03-04 10:33:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272644501] [2025-03-04 10:33:29,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:29,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:33:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:29,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:33:29,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:33:29,042 INFO L87 Difference]: Start difference. First operand 147 states and 194 transitions. Second operand has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-04 10:33:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:29,477 INFO L93 Difference]: Finished difference Result 348 states and 500 transitions. [2025-03-04 10:33:29,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:33:29,478 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) Word has length 1231 [2025-03-04 10:33:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:29,480 INFO L225 Difference]: With dead ends: 348 [2025-03-04 10:33:29,480 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 10:33:29,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2523 GetRequests, 2443 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1036, Invalid=2996, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:33:29,486 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 425 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:29,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 185 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 10:33:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186. [2025-03-04 10:33:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.033112582781457) internal successors, (156), 147 states have internal predecessors, (156), 23 states have call successors, (23), 17 states have call predecessors, (23), 11 states have return successors, (64), 21 states have call predecessors, (64), 22 states have call successors, (64) [2025-03-04 10:33:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 243 transitions. [2025-03-04 10:33:29,508 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 243 transitions. Word has length 1231 [2025-03-04 10:33:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:29,509 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 243 transitions. [2025-03-04 10:33:29,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.0) internal successors, (198), 33 states have internal predecessors, (198), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-04 10:33:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 243 transitions. [2025-03-04 10:33:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2025-03-04 10:33:29,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:29,514 INFO L218 NwaCegarLoop]: trace histogram [83, 82, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:29,523 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 10:33:29,714 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 10:33:29,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:29,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash -625276916, now seen corresponding path program 14 times [2025-03-04 10:33:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126161776] [2025-03-04 10:33:29,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:29,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 812 statements into 2 equivalence classes. [2025-03-04 10:33:29,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 812 of 812 statements. [2025-03-04 10:33:29,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 2257 proven. 4945 refuted. 0 times theorem prover too weak. 16657 trivial. 0 not checked. [2025-03-04 10:33:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:30,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126161776] [2025-03-04 10:33:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126161776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17817858] [2025-03-04 10:33:30,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:30,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:30,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:30,675 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 10:33:30,677 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 10:33:30,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 812 statements into 2 equivalence classes. [2025-03-04 10:33:30,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 812 of 812 statements. [2025-03-04 10:33:30,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:30,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:30,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:33:30,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 12210 proven. 2667 refuted. 0 times theorem prover too weak. 8982 trivial. 0 not checked. [2025-03-04 10:33:31,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 2246 proven. 5308 refuted. 0 times theorem prover too weak. 16305 trivial. 0 not checked. [2025-03-04 10:33:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17817858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:33,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:33,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 27] total 32 [2025-03-04 10:33:33,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864293351] [2025-03-04 10:33:33,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:33,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:33:33,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:33,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:33:33,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:33:33,684 INFO L87 Difference]: Start difference. First operand 186 states and 243 transitions. Second operand has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 10:33:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:34,074 INFO L93 Difference]: Finished difference Result 365 states and 494 transitions. [2025-03-04 10:33:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:33:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) Word has length 812 [2025-03-04 10:33:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:34,076 INFO L225 Difference]: With dead ends: 365 [2025-03-04 10:33:34,076 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 10:33:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1668 GetRequests, 1607 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:33:34,079 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 193 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 295 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 10:33:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 150. [2025-03-04 10:33:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 121 states have (on average 1.024793388429752) internal successors, (124), 119 states have internal predecessors, (124), 19 states have call successors, (19), 14 states have call predecessors, (19), 9 states have return successors, (45), 16 states have call predecessors, (45), 18 states have call successors, (45) [2025-03-04 10:33:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2025-03-04 10:33:34,089 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 812 [2025-03-04 10:33:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:34,089 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2025-03-04 10:33:34,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 26 states have call successors, (31), 2 states have call predecessors, (31), 14 states have return successors, (40), 14 states have call predecessors, (40), 26 states have call successors, (40) [2025-03-04 10:33:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2025-03-04 10:33:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1329 [2025-03-04 10:33:34,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:34,098 INFO L218 NwaCegarLoop]: trace histogram [136, 134, 110, 68, 68, 68, 68, 67, 67, 67, 67, 67, 67, 67, 67, 66, 42, 26, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:34,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:33:34,298 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 10:33:34,298 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 981927308, now seen corresponding path program 15 times [2025-03-04 10:33:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82957045] [2025-03-04 10:33:34,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:34,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1328 statements into 99 equivalence classes. [2025-03-04 10:33:34,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 789 of 1328 statements. [2025-03-04 10:33:34,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-04 10:33:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 64488 backedges. 5135 proven. 8146 refuted. 0 times theorem prover too weak. 51207 trivial. 0 not checked. [2025-03-04 10:33:35,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82957045] [2025-03-04 10:33:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82957045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601436253] [2025-03-04 10:33:35,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:35,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:35,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:35,264 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 10:33:35,265 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 10:33:35,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1328 statements into 99 equivalence classes. [2025-03-04 10:33:35,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) and asserted 789 of 1328 statements. [2025-03-04 10:33:35,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2025-03-04 10:33:35,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:33:35,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 64488 backedges. 5135 proven. 8146 refuted. 0 times theorem prover too weak. 51207 trivial. 0 not checked. [2025-03-04 10:33:35,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 64488 backedges. 5135 proven. 8311 refuted. 0 times theorem prover too weak. 51042 trivial. 0 not checked. [2025-03-04 10:33:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601436253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:39,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 31 [2025-03-04 10:33:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314071940] [2025-03-04 10:33:39,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:33:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:39,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:33:39,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:33:39,093 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. Second operand has 31 states, 31 states have (on average 5.774193548387097) internal successors, (179), 31 states have internal predecessors, (179), 23 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 18 states have call predecessors, (38), 23 states have call successors, (38) [2025-03-04 10:33:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:39,642 INFO L93 Difference]: Finished difference Result 381 states and 519 transitions. [2025-03-04 10:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:33:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.774193548387097) internal successors, (179), 31 states have internal predecessors, (179), 23 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 18 states have call predecessors, (38), 23 states have call successors, (38) Word has length 1328 [2025-03-04 10:33:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:39,647 INFO L225 Difference]: With dead ends: 381 [2025-03-04 10:33:39,647 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 10:33:39,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2722 GetRequests, 2643 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1101, Invalid=3321, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:33:39,652 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 605 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:39,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 229 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 10:33:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 192. [2025-03-04 10:33:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 153 states have internal predecessors, (161), 25 states have call successors, (25), 20 states have call predecessors, (25), 10 states have return successors, (63), 18 states have call predecessors, (63), 24 states have call successors, (63) [2025-03-04 10:33:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2025-03-04 10:33:39,669 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 1328 [2025-03-04 10:33:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2025-03-04 10:33:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.774193548387097) internal successors, (179), 31 states have internal predecessors, (179), 23 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (38), 18 states have call predecessors, (38), 23 states have call successors, (38) [2025-03-04 10:33:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2025-03-04 10:33:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2025-03-04 10:33:39,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:39,674 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, 1] [2025-03-04 10:33:39,682 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 10:33:39,875 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 10:33:39,875 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:39,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1890370776, now seen corresponding path program 16 times [2025-03-04 10:33:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338380456] [2025-03-04 10:33:39,876 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:39,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 916 statements into 2 equivalence classes. [2025-03-04 10:33:39,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 543 of 916 statements. [2025-03-04 10:33:39,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:39,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:40,465 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 10:33:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338380456] [2025-03-04 10:33:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338380456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470529116] [2025-03-04 10:33:40,465 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:40,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:40,467 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 10:33:40,468 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 10:33:40,666 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 916 statements into 2 equivalence classes. [2025-03-04 10:33:40,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 543 of 916 statements. [2025-03-04 10:33:40,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:40,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:40,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:33:40,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:40,916 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 10:33:40,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:43,841 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 10:33:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470529116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:43,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-04 10:33:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002885103] [2025-03-04 10:33:43,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:43,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:33:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:43,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:33:43,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:43,844 INFO L87 Difference]: Start difference. First operand 192 states and 249 transitions. Second operand has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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 10:33:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:44,260 INFO L93 Difference]: Finished difference Result 401 states and 540 transitions. [2025-03-04 10:33:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:33:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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 916 [2025-03-04 10:33:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:44,262 INFO L225 Difference]: With dead ends: 401 [2025-03-04 10:33:44,262 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 10:33:44,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1881 GetRequests, 1811 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 10:33:44,264 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 225 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:44,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 10:33:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 168. [2025-03-04 10:33:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.0222222222222221) internal successors, (138), 134 states have internal predecessors, (138), 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 10:33:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 216 transitions. [2025-03-04 10:33:44,275 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 216 transitions. Word has length 916 [2025-03-04 10:33:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:44,276 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 216 transitions. [2025-03-04 10:33:44,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 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 10:33:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 216 transitions. [2025-03-04 10:33:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2025-03-04 10:33:44,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:44,282 INFO L218 NwaCegarLoop]: trace histogram [110, 108, 89, 55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:44,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:33:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:33:44,486 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1836012417, now seen corresponding path program 17 times [2025-03-04 10:33:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260638976] [2025-03-04 10:33:44,487 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:44,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1073 statements into 76 equivalence classes. [2025-03-04 10:33:44,598 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 1073 of 1073 statements. [2025-03-04 10:33:44,599 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 10:33:44,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 7316 proven. 10535 refuted. 0 times theorem prover too weak. 24083 trivial. 0 not checked. [2025-03-04 10:34:00,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260638976] [2025-03-04 10:34:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260638976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:00,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170864093] [2025-03-04 10:34:00,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:00,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:00,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:00,589 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:00,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:34:00,822 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1073 statements into 76 equivalence classes. [2025-03-04 10:34:01,044 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) and asserted 1073 of 1073 statements. [2025-03-04 10:34:01,044 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 76 check-sat command(s) [2025-03-04 10:34:01,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:01,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-04 10:34:01,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 41934 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 27393 trivial. 0 not checked. [2025-03-04 10:34:01,722 INFO L312 TraceCheckSpWp]: Computing backward predicates...