./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci04-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4783e070fd2491b45504d9f6f3060ee7c5288027d9d113e851641208eae29b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:40:03,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:40:03,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:40:03,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:40:03,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:40:03,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:40:03,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:40:03,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:40:03,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:40:03,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:40:03,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:40:03,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:40:03,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:40:03,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:40:03,801 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:40:03,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:40:03,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:40:03,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:40:03,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:40:03,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:40:03,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:40:03,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:40:03,804 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4783e070fd2491b45504d9f6f3060ee7c5288027d9d113e851641208eae29b1 [2025-03-09 02:40:04,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:40:04,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:40:04,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:40:04,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:40:04,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:40:04,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04-overflow.c [2025-03-09 02:40:05,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183d23ad5/0c880be237394d68a17e20753ed2b534/FLAGca4215a33 [2025-03-09 02:40:05,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:40:05,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04-overflow.c [2025-03-09 02:40:05,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183d23ad5/0c880be237394d68a17e20753ed2b534/FLAGca4215a33 [2025-03-09 02:40:05,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183d23ad5/0c880be237394d68a17e20753ed2b534 [2025-03-09 02:40:05,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:40:05,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:40:05,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:40:05,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:40:05,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:40:05,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18eccf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05, skipping insertion in model container [2025-03-09 02:40:05,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:40:05,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:40:05,452 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:40:05,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:40:05,471 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:40:05,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05 WrapperNode [2025-03-09 02:40:05,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:40:05,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:40:05,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:40:05,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:40:05,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,488 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2025-03-09 02:40:05,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:40:05,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:40:05,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:40:05,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:40:05,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,508 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-09 02:40:05,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:40:05,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:40:05,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:40:05,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:40:05,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (1/1) ... [2025-03-09 02:40:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:40:05,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:05,538 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-09 02:40:05,543 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-09 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-09 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-09 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:40:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:40:05,599 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:40:05,600 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:40:05,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2025-03-09 02:40:05,698 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-09 02:40:05,698 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:40:05,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:40:05,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:40:05,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:40:05 BoogieIcfgContainer [2025-03-09 02:40:05,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:40:05,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:40:05,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:40:05,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:40:05,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:40:05" (1/3) ... [2025-03-09 02:40:05,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d5c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:40:05, skipping insertion in model container [2025-03-09 02:40:05,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:40:05" (2/3) ... [2025-03-09 02:40:05,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d5c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:40:05, skipping insertion in model container [2025-03-09 02:40:05,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:40:05" (3/3) ... [2025-03-09 02:40:05,713 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci04-overflow.c [2025-03-09 02:40:05,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:40:05,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci04-overflow.c that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 02:40:05,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:40:05,781 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;@564c31d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:40:05,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:40:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 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-09 02:40:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:40:05,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:05,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:05,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:05,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-03-09 02:40:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600994727] [2025-03-09 02:40:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:05,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:40:05,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:40:05,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:05,895 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-09 02:40:05,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:05,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600994727] [2025-03-09 02:40:05,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600994727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:40:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:40:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:40:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309505043] [2025-03-09 02:40:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:40:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:40:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:40:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:40:05,913 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 02:40:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:05,949 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-09 02:40:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:40:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-09 02:40:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:05,954 INFO L225 Difference]: With dead ends: 36 [2025-03-09 02:40:05,954 INFO L226 Difference]: Without dead ends: 24 [2025-03-09 02:40:05,956 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-09 02:40:05,957 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 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-09 02:40:05,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-09 02:40:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-09 02:40:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) 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-09 02:40:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-09 02:40:05,988 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-09 02:40:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:05,988 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-09 02:40:05,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 02:40:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-09 02:40:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:40:05,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:05,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:40:05,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-03-09 02:40:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153944442] [2025-03-09 02:40:05,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:05,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:40:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:40:06,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:06,046 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-09 02:40:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153944442] [2025-03-09 02:40:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153944442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:40:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:40:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:40:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386866074] [2025-03-09 02:40:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:40:06,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:40:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:40:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:40:06,048 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:06,103 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-09 02:40:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:40:06,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:40:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:06,104 INFO L225 Difference]: With dead ends: 24 [2025-03-09 02:40:06,105 INFO L226 Difference]: Without dead ends: 22 [2025-03-09 02:40:06,105 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-09 02:40:06,105 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:06,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-09 02:40:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-09 02:40:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 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-09 02:40:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-09 02:40:06,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-09 02:40:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:06,112 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-09 02:40:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:40:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-09 02:40:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:40:06,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:06,114 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:40:06,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:06,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-03-09 02:40:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527064584] [2025-03-09 02:40:06,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:40:06,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:40:06,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:40:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527064584] [2025-03-09 02:40:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527064584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:40:06,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:40:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:40:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40473458] [2025-03-09 02:40:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:40:06,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:40:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:40:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:40:06,268 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 02:40:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:06,306 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-09 02:40:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:40:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 29 [2025-03-09 02:40:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:06,307 INFO L225 Difference]: With dead ends: 34 [2025-03-09 02:40:06,307 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 02:40:06,307 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-09 02:40:06,307 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 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-09 02:40:06,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 02:40:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-09 02:40:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 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-09 02:40:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-09 02:40:06,316 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-03-09 02:40:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:06,316 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-09 02:40:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-09 02:40:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-09 02:40:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:40:06,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:06,317 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:40:06,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1650141125, now seen corresponding path program 1 times [2025-03-09 02:40:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179156027] [2025-03-09 02:40:06,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:40:06,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:40:06,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:06,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:40:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179156027] [2025-03-09 02:40:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179156027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841149444] [2025-03-09 02:40:06,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:06,433 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-09 02:40:06,434 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-09 02:40:06,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:40:06,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:40:06,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:06,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:06,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:40:06,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:40:06,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:40:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841149444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:06,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:06,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 02:40:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039453856] [2025-03-09 02:40:06,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:06,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:40:06,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:06,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:40:06,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:40:06,712 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-09 02:40:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:06,921 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2025-03-09 02:40:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:40:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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 24 [2025-03-09 02:40:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:06,923 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:40:06,923 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 02:40:06,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 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-09 02:40:06,926 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:06,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 02:40:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-09 02:40:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.105263157894737) internal successors, (42), 41 states have internal predecessors, (42), 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-09 02:40:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-03-09 02:40:06,940 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 24 [2025-03-09 02:40:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:06,941 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-03-09 02:40:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-09 02:40:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-03-09 02:40:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:40:06,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:06,942 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:40:06,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:40:07,146 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-09 02:40:07,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1771203833, now seen corresponding path program 2 times [2025-03-09 02:40:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791444736] [2025-03-09 02:40:07,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:07,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 02:40:07,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:40:07,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:07,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:40:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:07,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791444736] [2025-03-09 02:40:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791444736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225227377] [2025-03-09 02:40:07,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:07,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:07,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:07,245 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-09 02:40:07,247 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-09 02:40:07,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 02:40:07,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:40:07,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:07,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:40:07,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:40:07,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:40:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225227377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:40:07,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:40:07,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-09 02:40:07,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712300477] [2025-03-09 02:40:07,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:40:07,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:40:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:07,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:40:07,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:40:07,320 INFO L87 Difference]: Start difference. First operand 52 states and 67 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:40:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:07,351 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-09 02:40:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:40:07,351 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-09 02:40:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:07,352 INFO L225 Difference]: With dead ends: 59 [2025-03-09 02:40:07,352 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 02:40:07,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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-09 02:40:07,353 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 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-09 02:40:07,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 02:40:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-09 02:40:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.1) internal successors, (44), 42 states have internal predecessors, (44), 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-09 02:40:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-09 02:40:07,363 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2025-03-09 02:40:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-09 02:40:07,363 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:40:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-09 02:40:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:40:07,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:07,364 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-09 02:40:07,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:07,564 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-09 02:40:07,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash 927255998, now seen corresponding path program 1 times [2025-03-09 02:40:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432952856] [2025-03-09 02:40:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:07,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:40:07,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:40:07,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:07,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:40:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432952856] [2025-03-09 02:40:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432952856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573072608] [2025-03-09 02:40:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:07,635 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-09 02:40:07,637 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-09 02:40:07,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:40:07,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:40:07,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:07,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:40:07,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:40:07,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:40:07,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573072608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:40:07,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:40:07,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 02:40:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524900962] [2025-03-09 02:40:07,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:40:07,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:40:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:07,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:40:07,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:40:07,717 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:40:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:07,747 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2025-03-09 02:40:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:40:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-09 02:40:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:07,748 INFO L225 Difference]: With dead ends: 81 [2025-03-09 02:40:07,748 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:40:07,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:40:07,749 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:07,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:40:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-03-09 02:40:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 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-09 02:40:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-09 02:40:07,758 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 25 [2025-03-09 02:40:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-09 02:40:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:40:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-09 02:40:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:40:07,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:07,759 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] [2025-03-09 02:40:07,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:07,960 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-09 02:40:07,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1033276172, now seen corresponding path program 1 times [2025-03-09 02:40:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472799178] [2025-03-09 02:40:07,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:07,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:40:07,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:40:07,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:07,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:08,074 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-09 02:40:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472799178] [2025-03-09 02:40:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472799178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678208070] [2025-03-09 02:40:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:08,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:08,077 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-09 02:40:08,079 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-09 02:40:08,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:40:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:40:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:08,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:08,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:40:08,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:08,183 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-09 02:40:08,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:08,369 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-09 02:40:08,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678208070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:08,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-09 02:40:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297742037] [2025-03-09 02:40:08,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:08,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:40:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:08,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:40:08,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:40:08,372 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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-09 02:40:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:08,525 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2025-03-09 02:40:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:40:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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 45 [2025-03-09 02:40:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:08,528 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:40:08,531 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:40:08,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:40:08,532 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:08,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:40:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 97. [2025-03-09 02:40:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.08) internal successors, (81), 74 states have internal predecessors, (81), 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-09 02:40:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2025-03-09 02:40:08,552 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 45 [2025-03-09 02:40:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2025-03-09 02:40:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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-09 02:40:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2025-03-09 02:40:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 02:40:08,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:08,558 INFO L218 NwaCegarLoop]: trace histogram [14, 11, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1] [2025-03-09 02:40:08,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:08,758 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-09 02:40:08,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:08,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 520137223, now seen corresponding path program 1 times [2025-03-09 02:40:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768699158] [2025-03-09 02:40:08,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:08,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 02:40:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:40:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 55 proven. 155 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-09 02:40:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768699158] [2025-03-09 02:40:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768699158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909114656] [2025-03-09 02:40:08,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:40:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:08,908 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-09 02:40:08,909 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-09 02:40:08,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 02:40:08,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:40:08,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:08,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:40:08,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 309 proven. 67 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-09 02:40:09,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 69 proven. 202 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-09 02:40:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909114656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:09,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 13 [2025-03-09 02:40:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781388961] [2025-03-09 02:40:09,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:40:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:40:09,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:40:09,257 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:40:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:09,384 INFO L93 Difference]: Finished difference Result 223 states and 400 transitions. [2025-03-09 02:40:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:40:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 123 [2025-03-09 02:40:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:09,386 INFO L225 Difference]: With dead ends: 223 [2025-03-09 02:40:09,386 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:40:09,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 240 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:40:09,388 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 110 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:09,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 64 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:40:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2025-03-09 02:40:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 83 states have internal predecessors, (92), 12 states have call successors, (12), 3 states have call predecessors, (12), 10 states have return successors, (75), 22 states have call predecessors, (75), 11 states have call successors, (75) [2025-03-09 02:40:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 179 transitions. [2025-03-09 02:40:09,419 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 179 transitions. Word has length 123 [2025-03-09 02:40:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 179 transitions. [2025-03-09 02:40:09,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 8 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:40:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 179 transitions. [2025-03-09 02:40:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:40:09,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:09,424 INFO L218 NwaCegarLoop]: trace histogram [12, 10, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:40:09,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:09,624 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-09 02:40:09,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1065923531, now seen corresponding path program 2 times [2025-03-09 02:40:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971523199] [2025-03-09 02:40:09,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:09,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-09 02:40:09,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:40:09,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 30 proven. 88 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-09 02:40:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:09,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971523199] [2025-03-09 02:40:09,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971523199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:09,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960611722] [2025-03-09 02:40:09,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:09,707 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-09 02:40:09,708 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-09 02:40:09,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-09 02:40:09,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:40:09,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:09,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:09,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:40:09,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-09 02:40:09,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 4 proven. 90 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-09 02:40:10,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960611722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:10,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:10,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-09 02:40:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053622574] [2025-03-09 02:40:10,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:10,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:40:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:10,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:40:10,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:40:10,188 INFO L87 Difference]: Start difference. First operand 109 states and 179 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-09 02:40:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:10,282 INFO L93 Difference]: Finished difference Result 172 states and 292 transitions. [2025-03-09 02:40:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:40:10,283 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 106 [2025-03-09 02:40:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:10,283 INFO L225 Difference]: With dead ends: 172 [2025-03-09 02:40:10,283 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 02:40:10,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 200 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:40:10,285 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:10,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 02:40:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-09 02:40:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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-09 02:40:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-09 02:40:10,293 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 106 [2025-03-09 02:40:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:10,293 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-09 02:40:10,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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-09 02:40:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-09 02:40:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 02:40:10,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:10,296 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] [2025-03-09 02:40:10,302 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-09 02:40:10,500 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-09 02:40:10,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1721884890, now seen corresponding path program 2 times [2025-03-09 02:40:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518289574] [2025-03-09 02:40:10,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:10,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 02:40:10,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:40:10,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 53 proven. 135 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-09 02:40:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518289574] [2025-03-09 02:40:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518289574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036604678] [2025-03-09 02:40:10,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:10,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:10,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:10,635 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-09 02:40:10,637 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-09 02:40:10,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 02:40:10,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 02:40:10,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:10,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:10,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:40:10,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 269 proven. 15 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-09 02:40:10,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-09 02:40:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036604678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:11,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-09 02:40:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656630644] [2025-03-09 02:40:11,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:40:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:40:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:40:11,032 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:40:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:11,104 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2025-03-09 02:40:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:40:11,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 123 [2025-03-09 02:40:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:11,105 INFO L225 Difference]: With dead ends: 114 [2025-03-09 02:40:11,105 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 02:40:11,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 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-09 02:40:11,106 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:11,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:40:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 02:40:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 02:40:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (14), 8 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-09 02:40:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-03-09 02:40:11,113 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 123 [2025-03-09 02:40:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:11,113 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-03-09 02:40:11,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 7 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:40:11,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-03-09 02:40:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 02:40:11,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:11,114 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 12, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 1, 1, 1, 1] [2025-03-09 02:40:11,120 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-09 02:40:11,314 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-09 02:40:11,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:11,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 401923313, now seen corresponding path program 3 times [2025-03-09 02:40:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194603306] [2025-03-09 02:40:11,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:11,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 02:40:11,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 130 statements. [2025-03-09 02:40:11,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 02:40:11,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 210 proven. 18 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-09 02:40:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:11,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194603306] [2025-03-09 02:40:11,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194603306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:11,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265846942] [2025-03-09 02:40:11,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:11,395 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-09 02:40:11,396 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-09 02:40:11,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 02:40:11,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 130 statements. [2025-03-09 02:40:11,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 02:40:11,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:11,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:40:11,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 207 proven. 21 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-09 02:40:11,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 207 proven. 22 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-09 02:40:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265846942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:11,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-09 02:40:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368206463] [2025-03-09 02:40:11,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:40:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:11,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:40:11,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:40:11,717 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-09 02:40:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:11,791 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-03-09 02:40:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:40:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 130 [2025-03-09 02:40:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:11,793 INFO L225 Difference]: With dead ends: 107 [2025-03-09 02:40:11,793 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 02:40:11,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:40:11,794 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:11,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 70 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 02:40:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-03-09 02:40:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 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-09 02:40:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-09 02:40:11,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 130 [2025-03-09 02:40:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-09 02:40:11,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-09 02:40:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-09 02:40:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-09 02:40:11,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:11,800 INFO L218 NwaCegarLoop]: trace histogram [18, 15, 15, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 3, 1, 1, 1, 1] [2025-03-09 02:40:11,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:12,007 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-09 02:40:12,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:12,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2131406242, now seen corresponding path program 4 times [2025-03-09 02:40:12,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:12,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539420117] [2025-03-09 02:40:12,007 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:12,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-09 02:40:12,017 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 99 of 164 statements. [2025-03-09 02:40:12,017 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 120 proven. 355 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-09 02:40:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539420117] [2025-03-09 02:40:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539420117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159720019] [2025-03-09 02:40:12,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:12,141 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-09 02:40:12,143 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-09 02:40:12,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-03-09 02:40:12,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 99 of 164 statements. [2025-03-09 02:40:12,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:12,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:12,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:40:12,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 515 proven. 189 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-09 02:40:12,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 141 proven. 410 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-09 02:40:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159720019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:12,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19 [2025-03-09 02:40:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895182644] [2025-03-09 02:40:12,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:12,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:40:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:12,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:40:12,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:40:12,680 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-09 02:40:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:12,866 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2025-03-09 02:40:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:40:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 164 [2025-03-09 02:40:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:12,867 INFO L225 Difference]: With dead ends: 122 [2025-03-09 02:40:12,867 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 02:40:12,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 318 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:40:12,868 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 75 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 02:40:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2025-03-09 02:40:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 47 states have internal predecessors, (52), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-09 02:40:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-03-09 02:40:12,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 164 [2025-03-09 02:40:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:12,875 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-03-09 02:40:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-09 02:40:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-03-09 02:40:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-09 02:40:12,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:12,876 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 1, 1, 1, 1] [2025-03-09 02:40:12,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:40:13,076 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-09 02:40:13,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 42017479, now seen corresponding path program 5 times [2025-03-09 02:40:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275151786] [2025-03-09 02:40:13,078 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:13,087 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 182 statements into 15 equivalence classes. [2025-03-09 02:40:13,098 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 182 statements. [2025-03-09 02:40:13,099 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:40:13,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 281 proven. 362 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-09 02:40:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275151786] [2025-03-09 02:40:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275151786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054853636] [2025-03-09 02:40:13,263 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:13,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:13,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:13,265 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-09 02:40:13,267 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-09 02:40:13,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 182 statements into 15 equivalence classes. [2025-03-09 02:40:13,322 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 182 statements. [2025-03-09 02:40:13,322 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 02:40:13,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:13,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:40:13,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 263 proven. 345 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-03-09 02:40:13,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 267 proven. 357 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-09 02:40:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054853636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:13,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:13,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 21 [2025-03-09 02:40:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190410019] [2025-03-09 02:40:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:40:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:13,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:40:13,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:40:13,900 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 02:40:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:14,154 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2025-03-09 02:40:14,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:40:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) Word has length 182 [2025-03-09 02:40:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:14,156 INFO L225 Difference]: With dead ends: 148 [2025-03-09 02:40:14,156 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 02:40:14,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 355 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:14,157 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 106 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 119 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 02:40:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2025-03-09 02:40:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 61 states have internal predecessors, (67), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-09 02:40:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-09 02:40:14,162 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 182 [2025-03-09 02:40:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:14,162 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-09 02:40:14,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 02:40:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-09 02:40:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-09 02:40:14,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:14,163 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1] [2025-03-09 02:40:14,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:14,363 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-09 02:40:14,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:14,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1078160514, now seen corresponding path program 6 times [2025-03-09 02:40:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:14,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119187800] [2025-03-09 02:40:14,364 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:14,372 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 129 statements into 9 equivalence classes. [2025-03-09 02:40:14,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:40:14,387 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 02:40:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 183 proven. 132 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-09 02:40:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119187800] [2025-03-09 02:40:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119187800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513160991] [2025-03-09 02:40:14,497 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:14,499 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-09 02:40:14,500 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-09 02:40:14,529 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 129 statements into 9 equivalence classes. [2025-03-09 02:40:14,552 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:40:14,552 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 02:40:14,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:14,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:40:14,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 61 proven. 95 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-09 02:40:14,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 103 proven. 95 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-09 02:40:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513160991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:15,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-09 02:40:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144883381] [2025-03-09 02:40:15,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 02:40:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 02:40:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 02:40:15,480 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 02:40:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:15,994 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2025-03-09 02:40:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 02:40:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) Word has length 129 [2025-03-09 02:40:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:15,996 INFO L225 Difference]: With dead ends: 202 [2025-03-09 02:40:15,996 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 02:40:15,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 229 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:40:15,997 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 127 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:15,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 124 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:40:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 02:40:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2025-03-09 02:40:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.051948051948052) internal successors, (81), 76 states have internal predecessors, (81), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-09 02:40:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-03-09 02:40:16,008 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 129 [2025-03-09 02:40:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:16,008 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-09 02:40:16,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 02:40:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2025-03-09 02:40:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-09 02:40:16,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:16,013 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] [2025-03-09 02:40:16,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:40:16,213 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-09 02:40:16,214 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:16,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:16,214 INFO L85 PathProgramCache]: Analyzing trace with hash -237754126, now seen corresponding path program 7 times [2025-03-09 02:40:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:16,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230552614] [2025-03-09 02:40:16,214 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:16,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-09 02:40:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-09 02:40:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:16,646 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-09 02:40:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230552614] [2025-03-09 02:40:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230552614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361228516] [2025-03-09 02:40:16,646 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:16,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:16,648 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-09 02:40:16,650 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-09 02:40:16,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-09 02:40:16,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-09 02:40:16,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:16,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:16,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:40:16,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:16,903 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-09 02:40:16,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:17,965 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-09 02:40:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361228516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:17,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 27 [2025-03-09 02:40:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846691707] [2025-03-09 02:40:17,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:17,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 02:40:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:17,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 02:40:17,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:40:17,968 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 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-09 02:40:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:18,307 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2025-03-09 02:40:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 02:40:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 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 452 [2025-03-09 02:40:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:18,310 INFO L225 Difference]: With dead ends: 232 [2025-03-09 02:40:18,310 INFO L226 Difference]: Without dead ends: 140 [2025-03-09 02:40:18,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 889 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=589, Invalid=1667, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:40:18,313 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 278 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:18,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 140 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-09 02:40:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2025-03-09 02:40:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.063157894736842) internal successors, (101), 92 states have internal predecessors, (101), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-09 02:40:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-09 02:40:18,321 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 452 [2025-03-09 02:40:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:18,322 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-09 02:40:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 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-09 02:40:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-09 02:40:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-09 02:40:18,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:18,324 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 22, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 9, 5, 1, 1, 1, 1] [2025-03-09 02:40:18,331 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-09 02:40:18,529 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-09 02:40:18,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:18,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 925936582, now seen corresponding path program 8 times [2025-03-09 02:40:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488101213] [2025-03-09 02:40:18,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:18,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-09 02:40:18,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-09 02:40:18,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:18,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 571 proven. 345 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2025-03-09 02:40:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488101213] [2025-03-09 02:40:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488101213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171415225] [2025-03-09 02:40:18,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:18,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:18,746 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-09 02:40:18,746 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-09 02:40:18,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 261 statements into 2 equivalence classes. [2025-03-09 02:40:18,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 261 of 261 statements. [2025-03-09 02:40:18,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:18,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:40:18,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1197 proven. 484 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-03-09 02:40:18,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 511 proven. 831 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2025-03-09 02:40:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171415225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:19,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2025-03-09 02:40:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154444730] [2025-03-09 02:40:19,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 02:40:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:19,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 02:40:19,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:40:19,910 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 18 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-09 02:40:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:20,106 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-09 02:40:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:40:20,107 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 18 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 18 states have call successors, (32) Word has length 261 [2025-03-09 02:40:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:20,108 INFO L225 Difference]: With dead ends: 231 [2025-03-09 02:40:20,108 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 02:40:20,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 504 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:20,109 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:20,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 133 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 02:40:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2025-03-09 02:40:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.035294117647059) internal successors, (88), 83 states have internal predecessors, (88), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-09 02:40:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-03-09 02:40:20,115 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 261 [2025-03-09 02:40:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:20,115 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-03-09 02:40:20,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.72) internal successors, (143), 25 states have internal predecessors, (143), 18 states have call successors, (25), 2 states have call predecessors, (25), 10 states have return successors, (32), 12 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-09 02:40:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-03-09 02:40:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-09 02:40:20,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:20,118 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] [2025-03-09 02:40:20,124 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-09 02:40:20,318 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-09 02:40:20,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1369201927, now seen corresponding path program 9 times [2025-03-09 02:40:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396668346] [2025-03-09 02:40:20,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:20,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 589 statements into 41 equivalence classes. [2025-03-09 02:40:20,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 333 of 589 statements. [2025-03-09 02:40:20,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 02:40:20,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 3815 proven. 1063 refuted. 0 times theorem prover too weak. 7643 trivial. 0 not checked. [2025-03-09 02:40:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396668346] [2025-03-09 02:40:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396668346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246036765] [2025-03-09 02:40:21,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:21,837 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-09 02:40:21,839 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-09 02:40:21,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 589 statements into 41 equivalence classes. [2025-03-09 02:40:21,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 333 of 589 statements. [2025-03-09 02:40:21,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 02:40:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-09 02:40:21,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 3785 proven. 797 refuted. 0 times theorem prover too weak. 7939 trivial. 0 not checked. [2025-03-09 02:40:22,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12521 backedges. 4033 proven. 736 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2025-03-09 02:40:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246036765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:26,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:26,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 26] total 46 [2025-03-09 02:40:26,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815574537] [2025-03-09 02:40:26,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:26,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-09 02:40:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-09 02:40:26,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1667, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 02:40:26,609 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-09 02:40:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:26,844 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2025-03-09 02:40:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 02:40:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) Word has length 589 [2025-03-09 02:40:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:26,846 INFO L225 Difference]: With dead ends: 170 [2025-03-09 02:40:26,846 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 02:40:26,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1254 GetRequests, 1159 SyntacticMatches, 41 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=694, Invalid=2386, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:40:26,847 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:26,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:40:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 02:40:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2025-03-09 02:40:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.0265486725663717) internal successors, (116), 111 states have internal predecessors, (116), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-09 02:40:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2025-03-09 02:40:26,855 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 589 [2025-03-09 02:40:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:26,856 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2025-03-09 02:40:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 47 states have internal predecessors, (130), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (34), 33 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-09 02:40:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2025-03-09 02:40:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1165 [2025-03-09 02:40:26,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:26,863 INFO L218 NwaCegarLoop]: trace histogram [120, 117, 97, 60, 60, 60, 60, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1] [2025-03-09 02:40:26,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:27,063 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-09 02:40:27,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1232664598, now seen corresponding path program 10 times [2025-03-09 02:40:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563051355] [2025-03-09 02:40:27,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:27,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1164 statements into 2 equivalence classes. [2025-03-09 02:40:27,134 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 691 of 1164 statements. [2025-03-09 02:40:27,136 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:27,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 1193 proven. 7557 refuted. 0 times theorem prover too weak. 40871 trivial. 0 not checked. [2025-03-09 02:40:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563051355] [2025-03-09 02:40:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563051355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73554214] [2025-03-09 02:40:27,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:40:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:27,801 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-09 02:40:27,802 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-09 02:40:27,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1164 statements into 2 equivalence classes. [2025-03-09 02:40:28,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 691 of 1164 statements. [2025-03-09 02:40:28,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 02:40:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:28,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:40:28,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 25802 proven. 2740 refuted. 0 times theorem prover too weak. 21079 trivial. 0 not checked. [2025-03-09 02:40:28,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49621 backedges. 1428 proven. 9176 refuted. 0 times theorem prover too weak. 39017 trivial. 0 not checked. [2025-03-09 02:40:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73554214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:30,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-03-09 02:40:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470476049] [2025-03-09 02:40:30,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 02:40:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:30,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 02:40:30,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:40:30,222 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 02:40:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:30,591 INFO L93 Difference]: Finished difference Result 352 states and 577 transitions. [2025-03-09 02:40:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 02:40:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 1164 [2025-03-09 02:40:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:30,593 INFO L225 Difference]: With dead ends: 352 [2025-03-09 02:40:30,593 INFO L226 Difference]: Without dead ends: 215 [2025-03-09 02:40:30,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2380 GetRequests, 2311 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:40:30,596 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 226 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:30,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 158 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-09 02:40:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 193. [2025-03-09 02:40:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.032258064516129) internal successors, (160), 151 states have internal predecessors, (160), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-09 02:40:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2025-03-09 02:40:30,607 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 1164 [2025-03-09 02:40:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:30,607 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2025-03-09 02:40:30,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 02:40:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2025-03-09 02:40:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1171 [2025-03-09 02:40:30,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:30,614 INFO L218 NwaCegarLoop]: trace histogram [121, 117, 98, 61, 61, 61, 61, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1] [2025-03-09 02:40:30,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:30,815 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-09 02:40:30,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1515361948, now seen corresponding path program 11 times [2025-03-09 02:40:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285095070] [2025-03-09 02:40:30,816 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:30,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1170 statements into 85 equivalence classes. [2025-03-09 02:40:30,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 846 of 1170 statements. [2025-03-09 02:40:30,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-09 02:40:30,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 7301 proven. 4769 refuted. 0 times theorem prover too weak. 38068 trivial. 0 not checked. [2025-03-09 02:40:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285095070] [2025-03-09 02:40:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285095070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995454535] [2025-03-09 02:40:32,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:40:32,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:32,030 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-09 02:40:32,031 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-09 02:40:32,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1170 statements into 85 equivalence classes. [2025-03-09 02:40:32,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 846 of 1170 statements. [2025-03-09 02:40:32,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-09 02:40:32,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:32,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:40:32,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 7296 proven. 4742 refuted. 0 times theorem prover too weak. 38100 trivial. 0 not checked. [2025-03-09 02:40:32,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 7291 proven. 4889 refuted. 0 times theorem prover too weak. 37958 trivial. 0 not checked. [2025-03-09 02:40:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995454535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:35,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:35,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 30] total 38 [2025-03-09 02:40:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279755337] [2025-03-09 02:40:35,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:35,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-09 02:40:35,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:35,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 02:40:35,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 02:40:35,326 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 38 states, 38 states have (on average 5.2368421052631575) internal successors, (199), 38 states have internal predecessors, (199), 30 states have call successors, (34), 1 states have call predecessors, (34), 14 states have return successors, (43), 17 states have call predecessors, (43), 30 states have call successors, (43) [2025-03-09 02:40:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:35,840 INFO L93 Difference]: Finished difference Result 397 states and 658 transitions. [2025-03-09 02:40:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 02:40:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.2368421052631575) internal successors, (199), 38 states have internal predecessors, (199), 30 states have call successors, (34), 1 states have call predecessors, (34), 14 states have return successors, (43), 17 states have call predecessors, (43), 30 states have call successors, (43) Word has length 1170 [2025-03-09 02:40:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:35,843 INFO L225 Difference]: With dead ends: 397 [2025-03-09 02:40:35,843 INFO L226 Difference]: Without dead ends: 209 [2025-03-09 02:40:35,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2402 GetRequests, 2323 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1093, Invalid=3329, Unknown=0, NotChecked=0, Total=4422 [2025-03-09 02:40:35,846 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 448 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:35,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 223 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:40:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-09 02:40:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 175. [2025-03-09 02:40:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 138 states have internal predecessors, (147), 22 states have call successors, (22), 17 states have call predecessors, (22), 10 states have return successors, (57), 19 states have call predecessors, (57), 21 states have call successors, (57) [2025-03-09 02:40:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2025-03-09 02:40:35,860 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 1170 [2025-03-09 02:40:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:35,860 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2025-03-09 02:40:35,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2368421052631575) internal successors, (199), 38 states have internal predecessors, (199), 30 states have call successors, (34), 1 states have call predecessors, (34), 14 states have return successors, (43), 17 states have call predecessors, (43), 30 states have call successors, (43) [2025-03-09 02:40:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2025-03-09 02:40:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2025-03-09 02:40:35,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:35,864 INFO L218 NwaCegarLoop]: trace histogram [74, 72, 60, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 35, 23, 14, 1, 1, 1, 1] [2025-03-09 02:40:35,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:40:36,064 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-09 02:40:36,065 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 577518947, now seen corresponding path program 12 times [2025-03-09 02:40:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851862383] [2025-03-09 02:40:36,066 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:36,076 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 718 statements into 53 equivalence classes. [2025-03-09 02:40:36,109 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) and asserted 525 of 718 statements. [2025-03-09 02:40:36,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2025-03-09 02:40:36,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18692 backedges. 2926 proven. 2065 refuted. 0 times theorem prover too weak. 13701 trivial. 0 not checked. [2025-03-09 02:40:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851862383] [2025-03-09 02:40:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851862383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054207127] [2025-03-09 02:40:36,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 02:40:36,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:36,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:36,468 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-09 02:40:36,469 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-09 02:40:36,639 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 718 statements into 53 equivalence classes. [2025-03-09 02:40:36,755 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) and asserted 525 of 718 statements. [2025-03-09 02:40:36,755 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2025-03-09 02:40:36,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:36,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:40:36,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18692 backedges. 2911 proven. 2076 refuted. 0 times theorem prover too weak. 13705 trivial. 0 not checked. [2025-03-09 02:40:36,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18692 backedges. 2915 proven. 2140 refuted. 0 times theorem prover too weak. 13637 trivial. 0 not checked. [2025-03-09 02:40:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054207127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:38,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 21] total 24 [2025-03-09 02:40:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565977032] [2025-03-09 02:40:38,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:40:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:38,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:40:38,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:40:38,266 INFO L87 Difference]: Start difference. First operand 175 states and 226 transitions. Second operand has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 16 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2025-03-09 02:40:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:38,563 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2025-03-09 02:40:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 02:40:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 16 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) Word has length 718 [2025-03-09 02:40:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:38,566 INFO L225 Difference]: With dead ends: 389 [2025-03-09 02:40:38,566 INFO L226 Difference]: Without dead ends: 200 [2025-03-09 02:40:38,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1472 GetRequests, 1424 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=421, Invalid=1139, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 02:40:38,573 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 118 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:38,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 193 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-09 02:40:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 163. [2025-03-09 02:40:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 132 states have (on average 1.0303030303030303) internal successors, (136), 129 states have internal predecessors, (136), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (41), 16 states have call predecessors, (41), 20 states have call successors, (41) [2025-03-09 02:40:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2025-03-09 02:40:38,585 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 718 [2025-03-09 02:40:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:38,586 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2025-03-09 02:40:38,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.958333333333333) internal successors, (143), 24 states have internal predecessors, (143), 16 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2025-03-09 02:40:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2025-03-09 02:40:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2025-03-09 02:40:38,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:38,591 INFO L218 NwaCegarLoop]: trace histogram [93, 92, 75, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 29, 18, 1, 1, 1, 1] [2025-03-09 02:40:38,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:40:38,791 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-09 02:40:38,792 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2029554731, now seen corresponding path program 13 times [2025-03-09 02:40:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552251241] [2025-03-09 02:40:38,792 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:38,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:38,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-09 02:40:38,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-09 02:40:38,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3349 proven. 5088 refuted. 0 times theorem prover too weak. 21616 trivial. 0 not checked. [2025-03-09 02:40:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552251241] [2025-03-09 02:40:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552251241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911236509] [2025-03-09 02:40:39,911 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 02:40:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:39,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:39,915 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-09 02:40:39,916 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-09 02:40:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-09 02:40:40,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-09 02:40:40,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:40:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:40,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 02:40:40,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5527 refuted. 0 times theorem prover too weak. 20746 trivial. 0 not checked. [2025-03-09 02:40:40,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 30053 backedges. 3780 proven. 5699 refuted. 0 times theorem prover too weak. 20574 trivial. 0 not checked. [2025-03-09 02:40:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911236509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:43,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:43,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-09 02:40:43,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797944930] [2025-03-09 02:40:43,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 02:40:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:43,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 02:40:43,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 02:40:43,225 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 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-09 02:40:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:43,621 INFO L93 Difference]: Finished difference Result 356 states and 459 transitions. [2025-03-09 02:40:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 02:40:43,622 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 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 908 [2025-03-09 02:40:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:43,624 INFO L225 Difference]: With dead ends: 356 [2025-03-09 02:40:43,624 INFO L226 Difference]: Without dead ends: 198 [2025-03-09 02:40:43,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1865 GetRequests, 1795 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=805, Invalid=2387, Unknown=0, NotChecked=0, Total=3192 [2025-03-09 02:40:43,626 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 236 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:43,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 300 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-09 02:40:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2025-03-09 02:40:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 122 states have internal predecessors, (127), 20 states have call successors, (20), 15 states have call predecessors, (20), 9 states have return successors, (47), 16 states have call predecessors, (47), 19 states have call successors, (47) [2025-03-09 02:40:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2025-03-09 02:40:43,639 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 908 [2025-03-09 02:40:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:43,640 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2025-03-09 02:40:43,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 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-09 02:40:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2025-03-09 02:40:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2007 [2025-03-09 02:40:43,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:43,667 INFO L218 NwaCegarLoop]: trace histogram [207, 201, 168, 105, 105, 105, 105, 101, 101, 101, 101, 101, 100, 100, 100, 99, 63, 39, 1, 1, 1, 1] [2025-03-09 02:40:43,675 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-09 02:40:43,868 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-09 02:40:43,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash 653577758, now seen corresponding path program 14 times [2025-03-09 02:40:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113274245] [2025-03-09 02:40:43,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:43,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2006 statements into 2 equivalence classes. [2025-03-09 02:40:43,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2006 of 2006 statements. [2025-03-09 02:40:43,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 148300 backedges. 3912 proven. 15764 refuted. 0 times theorem prover too weak. 128624 trivial. 0 not checked. [2025-03-09 02:40:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113274245] [2025-03-09 02:40:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113274245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003163303] [2025-03-09 02:40:48,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:40:48,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:48,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:48,080 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-09 02:40:48,080 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-09 02:40:48,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2006 statements into 2 equivalence classes. [2025-03-09 02:40:48,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2006 of 2006 statements. [2025-03-09 02:40:48,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:40:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:48,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 3722 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 02:40:48,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 148300 backedges. 69904 proven. 10486 refuted. 0 times theorem prover too weak. 67910 trivial. 0 not checked. [2025-03-09 02:40:48,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 148300 backedges. 4625 proven. 18416 refuted. 0 times theorem prover too weak. 125259 trivial. 0 not checked. [2025-03-09 02:40:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003163303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:52,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 30] total 35 [2025-03-09 02:40:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373854696] [2025-03-09 02:40:52,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:52,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 02:40:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:52,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 02:40:52,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 02:40:52,222 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 30 states have call successors, (37), 7 states have call predecessors, (37), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-09 02:40:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:52,742 INFO L93 Difference]: Finished difference Result 354 states and 488 transitions. [2025-03-09 02:40:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 02:40:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 30 states have call successors, (37), 7 states have call predecessors, (37), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) Word has length 2006 [2025-03-09 02:40:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:52,745 INFO L225 Difference]: With dead ends: 354 [2025-03-09 02:40:52,745 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:40:52,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4077 GetRequests, 3990 SyntacticMatches, 22 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1201, Invalid=3221, Unknown=0, NotChecked=0, Total=4422 [2025-03-09 02:40:52,748 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 391 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:52,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 145 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:40:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:40:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 166. [2025-03-09 02:40:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.0225563909774436) internal successors, (136), 132 states have internal predecessors, (136), 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-09 02:40:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2025-03-09 02:40:52,758 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 2006 [2025-03-09 02:40:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2025-03-09 02:40:52,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 35 states have internal predecessors, (206), 30 states have call successors, (37), 7 states have call predecessors, (37), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-09 02:40:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2025-03-09 02:40:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-03-09 02:40:52,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:52,765 INFO L218 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 34, 21, 1, 1, 1, 1] [2025-03-09 02:40:52,775 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-09 02:40:52,965 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-09 02:40:52,965 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:40:52,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1029407192, now seen corresponding path program 15 times [2025-03-09 02:40:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:52,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690031813] [2025-03-09 02:40:52,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:52,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1065 statements into 83 equivalence classes. [2025-03-09 02:40:53,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) and asserted 1059 of 1065 statements. [2025-03-09 02:40:53,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2025-03-09 02:40:53,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 7610 proven. 9863 refuted. 0 times theorem prover too weak. 23993 trivial. 0 not checked. [2025-03-09 02:41:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690031813] [2025-03-09 02:41:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690031813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614363347] [2025-03-09 02:41:08,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:08,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:08,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:08,662 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-09 02:41:08,663 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-09 02:41:08,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1065 statements into 83 equivalence classes. [2025-03-09 02:41:09,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) and asserted 1059 of 1065 statements. [2025-03-09 02:41:09,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2025-03-09 02:41:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 1978 conjuncts, 217 conjuncts are in the unsatisfiable core [2025-03-09 02:41:09,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41466 backedges. 6686 proven. 7855 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2025-03-09 02:41:09,866 INFO L312 TraceCheckSpWp]: Computing backward predicates...