./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-numeric/Fibonacci01-2-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 694713b32fd9c1719d4a8995f33c66cfa1f4ebdac7358c65fcc55ce37970cfaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:45:38,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:45:38,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:45:38,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:45:38,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:45:38,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:45:38,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:45:38,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:45:38,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:45:38,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:45:38,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:45:38,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:45:38,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:45:38,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:45:38,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:45:38,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:45:38,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:45:38,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:45:38,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:45:38,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:45:38,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:45:38,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:38,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:45:38,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 694713b32fd9c1719d4a8995f33c66cfa1f4ebdac7358c65fcc55ce37970cfaf [2025-03-09 01:45:38,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:45:38,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:45:38,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:45:38,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:45:38,776 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:45:38,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c [2025-03-09 01:45:39,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ac71650/7d41db26a7b84ea3b9cc45f8844a2840/FLAGf8c084413 [2025-03-09 01:45:40,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:45:40,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2-overflow.c [2025-03-09 01:45:40,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ac71650/7d41db26a7b84ea3b9cc45f8844a2840/FLAGf8c084413 [2025-03-09 01:45:40,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ac71650/7d41db26a7b84ea3b9cc45f8844a2840 [2025-03-09 01:45:40,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:45:40,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:45:40,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:40,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:45:40,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:45:40,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40, skipping insertion in model container [2025-03-09 01:45:40,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:45:40,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:40,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:45:40,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:40,315 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:45:40,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40 WrapperNode [2025-03-09 01:45:40,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:40,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:40,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:45:40,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:45:40,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,334 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-09 01:45:40,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:40,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:45:40,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:45:40,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:45:40,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,346 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 01:45:40,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:45:40,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:45:40,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:45:40,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:45:40,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (1/1) ... [2025-03-09 01:45:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:40,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:40,374 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 01:45:40,378 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 01:45:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-09 01:45:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-09 01:45:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:45:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:45:40,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:45:40,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:45:40,432 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:45:40,433 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:45:40,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-09 01:45:40,518 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-09 01:45:40,518 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:45:40,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:45:40,524 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:45:40,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:40 BoogieIcfgContainer [2025-03-09 01:45:40,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:45:40,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:45:40,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:45:40,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:45:40,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:45:40" (1/3) ... [2025-03-09 01:45:40,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:40, skipping insertion in model container [2025-03-09 01:45:40,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:40" (2/3) ... [2025-03-09 01:45:40,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:40, skipping insertion in model container [2025-03-09 01:45:40,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:40" (3/3) ... [2025-03-09 01:45:40,531 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-2-overflow.c [2025-03-09 01:45:40,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:45:40,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-2-overflow.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 01:45:40,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:45:40,592 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;@3b2b7660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:45:40,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:45:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:45:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:45:40,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:40,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:40,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:40,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 154990982, now seen corresponding path program 1 times [2025-03-09 01:45:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199091932] [2025-03-09 01:45:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:40,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:45:40,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:45:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:40,720 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 01:45:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199091932] [2025-03-09 01:45:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199091932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:45:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531701794] [2025-03-09 01:45:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:40,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:45:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:40,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:45:40,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:40,739 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:40,767 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-09 01:45:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:45:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:45:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:40,773 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:45:40,773 INFO L226 Difference]: Without dead ends: 25 [2025-03-09 01:45:40,775 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 01:45:40,776 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:40,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-09 01:45:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-09 01:45:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-09 01:45:40,800 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2025-03-09 01:45:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:40,800 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-09 01:45:40,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-09 01:45:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:45:40,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:40,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:40,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:45:40,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:40,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash 509753131, now seen corresponding path program 1 times [2025-03-09 01:45:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434754440] [2025-03-09 01:45:40,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:40,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:45:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:45:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:40,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:40,858 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 01:45:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434754440] [2025-03-09 01:45:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434754440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:40,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:40,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564044521] [2025-03-09 01:45:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:40,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:45:40,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:40,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:45:40,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:40,860 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:40,919 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-09 01:45:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:45:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:40,920 INFO L225 Difference]: With dead ends: 25 [2025-03-09 01:45:40,921 INFO L226 Difference]: Without dead ends: 23 [2025-03-09 01:45:40,921 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 01:45:40,921 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:40,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-09 01:45:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-09 01:45:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-09 01:45:40,926 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2025-03-09 01:45:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:40,926 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-09 01:45:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-09 01:45:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:45:40,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:40,927 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 01:45:40,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:45:40,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:40,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -984405394, now seen corresponding path program 1 times [2025-03-09 01:45:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067872110] [2025-03-09 01:45:40,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:40,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:45:40,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:45:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:45:41,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067872110] [2025-03-09 01:45:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067872110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:41,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692093527] [2025-03-09 01:45:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:41,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:45:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:41,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:45:41,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:41,028 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:41,070 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-09 01:45:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-09 01:45:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:41,071 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:45:41,071 INFO L226 Difference]: Without dead ends: 33 [2025-03-09 01:45:41,072 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 01:45:41,073 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:41,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-09 01:45:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-09 01:45:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 01:45:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-09 01:45:41,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2025-03-09 01:45:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,084 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-09 01:45:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-09 01:45:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 01:45:41,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,085 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:41,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:45:41,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash -119709208, now seen corresponding path program 1 times [2025-03-09 01:45:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155505138] [2025-03-09 01:45:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:45:41,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:45:41,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:45:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155505138] [2025-03-09 01:45:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155505138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641286160] [2025-03-09 01:45:41,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:41,192 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 01:45:41,193 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 01:45:41,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:45:41,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:45:41,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:45:41,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:45:41,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 01:45:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641286160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:41,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-09 01:45:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024009604] [2025-03-09 01:45:41,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:45:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:45:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:45:41,447 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 01:45:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:41,669 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2025-03-09 01:45:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:45:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-09 01:45:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:41,670 INFO L225 Difference]: With dead ends: 91 [2025-03-09 01:45:41,670 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 01:45:41,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:45:41,671 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:41,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 01:45:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-03-09 01:45:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-09 01:45:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-03-09 01:45:41,684 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 31 [2025-03-09 01:45:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:41,684 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-03-09 01:45:41,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 01:45:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2025-03-09 01:45:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:45:41,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:41,685 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 01:45:41,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:41,885 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 01:45:41,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1220480843, now seen corresponding path program 2 times [2025-03-09 01:45:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-09 01:45:41,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:41,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:45:41,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:45:41,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:41,970 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 01:45:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-09 01:45:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039125414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117789977] [2025-03-09 01:45:41,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:41,972 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 01:45:41,974 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 01:45:41,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:45:41,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:45:41,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:42,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:45:42,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:42,033 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 01:45:42,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117789977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-09 01:45:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711786772] [2025-03-09 01:45:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:45:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:42,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:45:42,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:42,034 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:42,055 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2025-03-09 01:45:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-09 01:45:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:42,058 INFO L225 Difference]: With dead ends: 60 [2025-03-09 01:45:42,058 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 01:45:42,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:45:42,059 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:42,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 01:45:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-09 01:45:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 43 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-09 01:45:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-03-09 01:45:42,071 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 25 [2025-03-09 01:45:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:42,071 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-03-09 01:45:42,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-03-09 01:45:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:45:42,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:42,072 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:42,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:45:42,273 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 01:45:42,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash -819799558, now seen corresponding path program 1 times [2025-03-09 01:45:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357315378] [2025-03-09 01:45:42,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:42,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:45:42,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:45:42,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,325 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 01:45:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357315378] [2025-03-09 01:45:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357315378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384974312] [2025-03-09 01:45:42,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:42,328 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 01:45:42,329 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 01:45:42,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:45:42,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:45:42,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:45:42,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:42,389 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 01:45:42,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:45:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384974312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:42,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:45:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:45:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838075902] [2025-03-09 01:45:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:42,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:45:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:42,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:45:42,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:42,391 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:42,415 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-09 01:45:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:45:42,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-09 01:45:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:42,417 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:45:42,417 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 01:45:42,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:42,417 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:42,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 01:45:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-03-09 01:45:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-09 01:45:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-09 01:45:42,426 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 26 [2025-03-09 01:45:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:42,426 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-09 01:45:42,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:45:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-09 01:45:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:45:42,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:42,428 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:42,433 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 01:45:42,628 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 01:45:42,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:42,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1588695901, now seen corresponding path program 1 times [2025-03-09 01:45:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-03-09 01:45:42,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:42,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:45:42,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:45:42,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 01:45:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642785089] [2025-03-09 01:45:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642785089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759333726] [2025-03-09 01:45:42,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:42,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:42,775 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 01:45:42,777 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 01:45:42,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:45:42,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:45:42,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:42,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:45:42,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-09 01:45:42,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:45:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759333726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:43,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-09 01:45:43,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173763850] [2025-03-09 01:45:43,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:45:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:43,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:45:43,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:45:43,030 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:43,185 INFO L93 Difference]: Finished difference Result 141 states and 217 transitions. [2025-03-09 01:45:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:45:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 52 [2025-03-09 01:45:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:43,187 INFO L225 Difference]: With dead ends: 141 [2025-03-09 01:45:43,187 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 01:45:43,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:45:43,188 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:43,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 177 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 01:45:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2025-03-09 01:45:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 75 states have internal predecessors, (82), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-09 01:45:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 159 transitions. [2025-03-09 01:45:43,212 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 159 transitions. Word has length 52 [2025-03-09 01:45:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:43,213 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 159 transitions. [2025-03-09 01:45:43,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 159 transitions. [2025-03-09 01:45:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 01:45:43,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:43,217 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:43,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:45:43,417 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 01:45:43,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:43,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash 993600403, now seen corresponding path program 1 times [2025-03-09 01:45:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-03-09 01:45:43,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:43,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 01:45:43,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 01:45:43,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:45:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-03-09 01:45:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627037862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080383986] [2025-03-09 01:45:43,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:43,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:43,541 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 01:45:43,542 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 01:45:43,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 01:45:43,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 01:45:43,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:43,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:43,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:43,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-09 01:45:43,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-09 01:45:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080383986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:43,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:43,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 18 [2025-03-09 01:45:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840484913] [2025-03-09 01:45:43,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:45:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:43,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:45:43,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:45:43,831 INFO L87 Difference]: Start difference. First operand 98 states and 159 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 01:45:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:44,320 INFO L93 Difference]: Finished difference Result 257 states and 504 transitions. [2025-03-09 01:45:44,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 01:45:44,321 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) Word has length 63 [2025-03-09 01:45:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:44,323 INFO L225 Difference]: With dead ends: 257 [2025-03-09 01:45:44,323 INFO L226 Difference]: Without dead ends: 163 [2025-03-09 01:45:44,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 01:45:44,330 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:44,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:45:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-09 01:45:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 103. [2025-03-09 01:45:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 12 states have call successors, (12), 3 states have call predecessors, (12), 10 states have return successors, (75), 19 states have call predecessors, (75), 11 states have call successors, (75) [2025-03-09 01:45:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 171 transitions. [2025-03-09 01:45:44,353 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 171 transitions. Word has length 63 [2025-03-09 01:45:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:44,355 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 171 transitions. [2025-03-09 01:45:44,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-09 01:45:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 171 transitions. [2025-03-09 01:45:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-09 01:45:44,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:44,358 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 10, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:45:44,365 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 01:45:44,564 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 01:45:44,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:44,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1513623466, now seen corresponding path program 2 times [2025-03-09 01:45:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434756095] [2025-03-09 01:45:44,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:44,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 01:45:44,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 01:45:44,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 35 proven. 126 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-09 01:45:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434756095] [2025-03-09 01:45:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434756095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:44,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481016087] [2025-03-09 01:45:44,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:44,661 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 01:45:44,663 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 01:45:44,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 01:45:44,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 01:45:44,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:44,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:44,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:45:44,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 01:45:44,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 9 proven. 130 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 01:45:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481016087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:45,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-09 01:45:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165159651] [2025-03-09 01:45:45,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:45:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:45,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:45:45,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:45:45,082 INFO L87 Difference]: Start difference. First operand 103 states and 171 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:45,150 INFO L93 Difference]: Finished difference Result 162 states and 278 transitions. [2025-03-09 01:45:45,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:45:45,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 129 [2025-03-09 01:45:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:45,151 INFO L225 Difference]: With dead ends: 162 [2025-03-09 01:45:45,152 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 01:45:45,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:45:45,153 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:45,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 01:45:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-09 01:45:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (26), 10 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-09 01:45:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-09 01:45:45,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 129 [2025-03-09 01:45:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:45,158 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-09 01:45:45,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-09 01:45:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 01:45:45,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:45,160 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:45:45,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:45:45,360 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 01:45:45,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1695716789, now seen corresponding path program 3 times [2025-03-09 01:45:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-03-09 01:45:45,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:45,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 01:45:45,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-09 01:45:45,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:45:45,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 207 proven. 18 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 01:45:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-03-09 01:45:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330734440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479180425] [2025-03-09 01:45:45,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:45,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:45,462 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 01:45:45,464 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 01:45:45,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 01:45:45,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 71 of 130 statements. [2025-03-09 01:45:45,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:45:45,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:45,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:45:45,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-09 01:45:45,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 204 proven. 22 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-09 01:45:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479180425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:45,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-09 01:45:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928421416] [2025-03-09 01:45:45,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:45:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:45:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:45:45,796 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:45,874 INFO L93 Difference]: Finished difference Result 124 states and 179 transitions. [2025-03-09 01:45:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:45:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 130 [2025-03-09 01:45:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:45,875 INFO L225 Difference]: With dead ends: 124 [2025-03-09 01:45:45,875 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 01:45:45,879 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 01:45:45,879 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:45,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 81 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 01:45:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 01:45:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (22), 10 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-09 01:45:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2025-03-09 01:45:45,886 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 130 [2025-03-09 01:45:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:45,887 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2025-03-09 01:45:45,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:45:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2025-03-09 01:45:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 01:45:45,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:45,888 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:45:45,895 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 01:45:46,090 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 01:45:46,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:46,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1396439778, now seen corresponding path program 4 times [2025-03-09 01:45:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120108746] [2025-03-09 01:45:46,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:45:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:46,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-09 01:45:46,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 124 statements. [2025-03-09 01:45:46,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:45:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 97 proven. 216 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-09 01:45:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120108746] [2025-03-09 01:45:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120108746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943625680] [2025-03-09 01:45:46,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:45:46,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:46,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:46,251 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 01:45:46,252 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 01:45:46,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 124 statements into 2 equivalence classes. [2025-03-09 01:45:46,289 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 124 statements. [2025-03-09 01:45:46,289 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:45:46,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:45:46,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 218 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-09 01:45:46,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 114 proven. 234 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-09 01:45:46,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943625680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:46,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:46,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-09 01:45:46,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957467072] [2025-03-09 01:45:46,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:46,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:45:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:46,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:45:46,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:45:46,864 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 01:45:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:47,059 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2025-03-09 01:45:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:45:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) Word has length 124 [2025-03-09 01:45:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:47,061 INFO L225 Difference]: With dead ends: 134 [2025-03-09 01:45:47,061 INFO L226 Difference]: Without dead ends: 73 [2025-03-09 01:45:47,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 238 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:45:47,062 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:47,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 109 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-09 01:45:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-03-09 01:45:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-09 01:45:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-09 01:45:47,066 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 124 [2025-03-09 01:45:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:47,066 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-09 01:45:47,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 14 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 01:45:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-09 01:45:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-09 01:45:47,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:47,067 INFO L218 NwaCegarLoop]: trace histogram [19, 18, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 1, 1, 1, 1, 1] [2025-03-09 01:45:47,075 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 01:45:47,268 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 01:45:47,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:47,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -552937243, now seen corresponding path program 5 times [2025-03-09 01:45:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-09 01:45:47,269 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:45:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:47,274 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-09 01:45:47,285 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-09 01:45:47,285 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 01:45:47,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:47,509 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 01:45:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-09 01:45:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418880027] [2025-03-09 01:45:47,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:45:47,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:47,511 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 01:45:47,513 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 01:45:47,542 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 183 statements into 15 equivalence classes. [2025-03-09 01:45:47,566 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 141 of 183 statements. [2025-03-09 01:45:47,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-09 01:45:47,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:47,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:45:47,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:47,641 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 01:45:47,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:48,146 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 01:45:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418880027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:48,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 21 [2025-03-09 01:45:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403857870] [2025-03-09 01:45:48,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:48,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:45:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:48,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:45:48,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:45:48,148 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 01:45:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:48,444 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2025-03-09 01:45:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:45:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) Word has length 183 [2025-03-09 01:45:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:48,446 INFO L225 Difference]: With dead ends: 149 [2025-03-09 01:45:48,446 INFO L226 Difference]: Without dead ends: 93 [2025-03-09 01:45:48,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 357 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:45:48,447 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:48,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 124 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:45:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-09 01:45:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-09 01:45:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.0625) internal successors, (68), 62 states have internal predecessors, (68), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-09 01:45:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2025-03-09 01:45:48,454 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 183 [2025-03-09 01:45:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:48,454 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2025-03-09 01:45:48,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-09 01:45:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2025-03-09 01:45:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 01:45:48,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:48,455 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:45:48,464 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 01:45:48,655 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 01:45:48,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:48,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1715536077, now seen corresponding path program 6 times [2025-03-09 01:45:48,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057503138] [2025-03-09 01:45:48,656 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:45:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:48,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-09 01:45:48,674 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 01:45:48,674 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 01:45:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:48,819 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 01:45:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057503138] [2025-03-09 01:45:48,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057503138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185362279] [2025-03-09 01:45:48,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:45:48,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:48,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:48,821 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 01:45:48,823 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 01:45:48,856 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 9 equivalence classes. [2025-03-09 01:45:48,880 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 01:45:48,881 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-09 01:45:48,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:48,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:45:48,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:49,069 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 01:45:49,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:49,867 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 01:45:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185362279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:49,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-09 01:45:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973382743] [2025-03-09 01:45:49,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:49,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 01:45:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:49,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 01:45:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 01:45:49,870 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 01:45:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:50,339 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-03-09 01:45:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:45:50,340 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) Word has length 130 [2025-03-09 01:45:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:50,341 INFO L225 Difference]: With dead ends: 203 [2025-03-09 01:45:50,341 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:45:50,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 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 01:45:50,342 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 149 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:50,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 123 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:45:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:45:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2025-03-09 01:45:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-09 01:45:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2025-03-09 01:45:50,349 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 130 [2025-03-09 01:45:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:50,349 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2025-03-09 01:45:50,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 states have internal predecessors, (115), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-09 01:45:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2025-03-09 01:45:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-09 01:45:50,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:50,353 INFO L218 NwaCegarLoop]: trace histogram [49, 45, 40, 25, 25, 25, 25, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1, 1] [2025-03-09 01:45:50,358 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 01:45:50,553 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 01:45:50,553 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1194404785, now seen corresponding path program 7 times [2025-03-09 01:45:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:50,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625727019] [2025-03-09 01:45:50,554 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:45:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-09 01:45:50,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-09 01:45:50,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:50,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 593 proven. 1908 refuted. 0 times theorem prover too weak. 5216 trivial. 0 not checked. [2025-03-09 01:45:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:51,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625727019] [2025-03-09 01:45:51,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625727019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:51,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890939036] [2025-03-09 01:45:51,014 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:45:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:51,016 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 01:45:51,018 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 01:45:51,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-09 01:45:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-09 01:45:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:51,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:45:51,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 4011 proven. 1274 refuted. 0 times theorem prover too weak. 2432 trivial. 0 not checked. [2025-03-09 01:45:51,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7717 backedges. 684 proven. 2447 refuted. 0 times theorem prover too weak. 4586 trivial. 0 not checked. [2025-03-09 01:45:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890939036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:52,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 21] total 26 [2025-03-09 01:45:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848519128] [2025-03-09 01:45:52,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:52,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:45:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:52,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:45:52,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:45:52,249 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-09 01:45:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:52,529 INFO L93 Difference]: Finished difference Result 233 states and 308 transitions. [2025-03-09 01:45:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:45:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) Word has length 465 [2025-03-09 01:45:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:52,531 INFO L225 Difference]: With dead ends: 233 [2025-03-09 01:45:52,531 INFO L226 Difference]: Without dead ends: 141 [2025-03-09 01:45:52,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 915 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=568, Invalid=1502, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:45:52,533 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 236 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:52,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 121 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-09 01:45:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2025-03-09 01:45:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.0625) internal successors, (102), 93 states have internal predecessors, (102), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-09 01:45:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2025-03-09 01:45:52,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 465 [2025-03-09 01:45:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:52,542 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2025-03-09 01:45:52,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.0) internal successors, (156), 26 states have internal predecessors, (156), 21 states have call successors, (28), 4 states have call predecessors, (28), 10 states have return successors, (31), 12 states have call predecessors, (31), 19 states have call successors, (31) [2025-03-09 01:45:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2025-03-09 01:45:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-09 01:45:52,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:52,545 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 26, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6, 1, 1, 1, 1, 1] [2025-03-09 01:45:52,552 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 01:45:52,746 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 01:45:52,746 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:52,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:52,746 INFO L85 PathProgramCache]: Analyzing trace with hash -449393690, now seen corresponding path program 8 times [2025-03-09 01:45:52,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:52,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164543812] [2025-03-09 01:45:52,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:52,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-09 01:45:52,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-09 01:45:52,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:52,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 554 proven. 990 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2025-03-09 01:45:53,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164543812] [2025-03-09 01:45:53,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164543812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332955174] [2025-03-09 01:45:53,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:53,032 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 01:45:53,033 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 01:45:53,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 307 statements into 2 equivalence classes. [2025-03-09 01:45:53,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-09 01:45:53,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:53,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:45:53,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 1858 proven. 484 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2025-03-09 01:45:53,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3282 backedges. 551 proven. 1101 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2025-03-09 01:45:54,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332955174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:54,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:54,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-09 01:45:54,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392377231] [2025-03-09 01:45:54,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:54,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:45:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:54,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:45:54,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:45:54,193 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-09 01:45:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:54,418 INFO L93 Difference]: Finished difference Result 232 states and 300 transitions. [2025-03-09 01:45:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:45:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 307 [2025-03-09 01:45:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:54,420 INFO L225 Difference]: With dead ends: 232 [2025-03-09 01:45:54,420 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 01:45:54,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 601 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:45:54,421 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:54,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 154 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 01:45:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2025-03-09 01:45:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 84 states have internal predecessors, (89), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-09 01:45:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2025-03-09 01:45:54,430 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 307 [2025-03-09 01:45:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2025-03-09 01:45:54,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 18 states have call successors, (23), 2 states have call predecessors, (23), 10 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2025-03-09 01:45:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2025-03-09 01:45:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-09 01:45:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:54,437 INFO L218 NwaCegarLoop]: trace histogram [63, 59, 51, 32, 32, 32, 32, 30, 30, 30, 30, 30, 29, 29, 29, 28, 19, 12, 1, 1, 1, 1, 1] [2025-03-09 01:45:54,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:54,637 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 01:45:54,637 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash -634311118, now seen corresponding path program 9 times [2025-03-09 01:45:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719842266] [2025-03-09 01:45:54,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:54,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-09 01:45:54,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-09 01:45:54,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 01:45:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 1063 refuted. 0 times theorem prover too weak. 8201 trivial. 0 not checked. [2025-03-09 01:45:56,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:56,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719842266] [2025-03-09 01:45:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719842266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:56,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111213896] [2025-03-09 01:45:56,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:56,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:56,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:56,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:45:56,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 602 statements into 47 equivalence classes. [2025-03-09 01:45:56,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 334 of 602 statements. [2025-03-09 01:45:56,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-09 01:45:56,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:56,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-09 01:45:56,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 3785 proven. 797 refuted. 0 times theorem prover too weak. 8467 trivial. 0 not checked. [2025-03-09 01:45:56,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13049 backedges. 4033 proven. 736 refuted. 0 times theorem prover too weak. 8280 trivial. 0 not checked. [2025-03-09 01:46:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111213896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:00,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:00,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 26] total 45 [2025-03-09 01:46:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895882485] [2025-03-09 01:46:00,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:00,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 01:46:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 01:46:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:46:00,595 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-09 01:46:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:00,820 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2025-03-09 01:46:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:46:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) Word has length 602 [2025-03-09 01:46:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:00,823 INFO L225 Difference]: With dead ends: 171 [2025-03-09 01:46:00,824 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 01:46:00,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1280 GetRequests, 1186 SyntacticMatches, 41 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=2316, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 01:46:00,825 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:00,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 228 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:46:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 01:46:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2025-03-09 01:46:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 112 states have internal predecessors, (117), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-09 01:46:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 204 transitions. [2025-03-09 01:46:00,835 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 204 transitions. Word has length 602 [2025-03-09 01:46:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:00,837 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 204 transitions. [2025-03-09 01:46:00,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 46 states have internal predecessors, (128), 12 states have call successors, (14), 1 states have call predecessors, (14), 14 states have return successors, (33), 32 states have call predecessors, (33), 12 states have call successors, (33) [2025-03-09 01:46:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2025-03-09 01:46:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-03-09 01:46:00,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:00,844 INFO L218 NwaCegarLoop]: trace histogram [121, 117, 98, 61, 61, 61, 61, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1, 1] [2025-03-09 01:46:00,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:46:01,046 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 01:46:01,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:01,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 53326905, now seen corresponding path program 10 times [2025-03-09 01:46:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:01,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269689799] [2025-03-09 01:46:01,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:46:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:01,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-09 01:46:01,115 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 696 of 1171 statements. [2025-03-09 01:46:01,115 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:46:01,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1242 proven. 7557 refuted. 0 times theorem prover too weak. 41339 trivial. 0 not checked. [2025-03-09 01:46:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269689799] [2025-03-09 01:46:01,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269689799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187518600] [2025-03-09 01:46:01,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:46:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:01,802 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 01:46:01,803 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 01:46:01,947 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1171 statements into 2 equivalence classes. [2025-03-09 01:46:02,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 696 of 1171 statements. [2025-03-09 01:46:02,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:46:02,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:02,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:46:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 26148 proven. 2740 refuted. 0 times theorem prover too weak. 21250 trivial. 0 not checked. [2025-03-09 01:46:02,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 50138 backedges. 1487 proven. 9176 refuted. 0 times theorem prover too weak. 39475 trivial. 0 not checked. [2025-03-09 01:46:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187518600] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:04,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 25] total 30 [2025-03-09 01:46:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342091789] [2025-03-09 01:46:04,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:46:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:04,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:46:04,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:46:04,220 INFO L87 Difference]: Start difference. First operand 143 states and 204 transitions. Second operand has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 01:46:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:04,625 INFO L93 Difference]: Finished difference Result 353 states and 578 transitions. [2025-03-09 01:46:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:46:04,625 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) Word has length 1171 [2025-03-09 01:46:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:04,627 INFO L225 Difference]: With dead ends: 353 [2025-03-09 01:46:04,627 INFO L226 Difference]: Without dead ends: 216 [2025-03-09 01:46:04,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2394 GetRequests, 2325 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=2284, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 01:46:04,629 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 183 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:04,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 177 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-09 01:46:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2025-03-09 01:46:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.0320512820512822) internal successors, (161), 152 states have internal predecessors, (161), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-09 01:46:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 274 transitions. [2025-03-09 01:46:04,643 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 274 transitions. Word has length 1171 [2025-03-09 01:46:04,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:04,644 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 274 transitions. [2025-03-09 01:46:04,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.0) internal successors, (180), 30 states have internal predecessors, (180), 25 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (37), 14 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 01:46:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 274 transitions. [2025-03-09 01:46:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1160 [2025-03-09 01:46:04,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:04,652 INFO L218 NwaCegarLoop]: trace histogram [119, 117, 96, 59, 59, 59, 59, 59, 59, 59, 59, 59, 58, 58, 58, 57, 37, 23, 1, 1, 1, 1, 1] [2025-03-09 01:46:04,659 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 01:46:04,856 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 01:46:04,856 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 648831603, now seen corresponding path program 11 times [2025-03-09 01:46:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-03-09 01:46:04,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:46:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:04,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1159 statements into 91 equivalence classes. [2025-03-09 01:46:04,941 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) and asserted 801 of 1159 statements. [2025-03-09 01:46:04,941 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2025-03-09 01:46:04,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49110 backedges. 5414 proven. 3280 refuted. 0 times theorem prover too weak. 40416 trivial. 0 not checked. [2025-03-09 01:46:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12149517] [2025-03-09 01:46:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12149517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392226583] [2025-03-09 01:46:05,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:46:05,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:05,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:05,583 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 01:46:05,584 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 01:46:05,749 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1159 statements into 91 equivalence classes. [2025-03-09 01:46:05,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) and asserted 801 of 1159 statements. [2025-03-09 01:46:05,925 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2025-03-09 01:46:05,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:05,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1485 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:46:05,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 49110 backedges. 23675 proven. 1171 refuted. 0 times theorem prover too weak. 24264 trivial. 0 not checked. [2025-03-09 01:46:06,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 49110 backedges. 5608 proven. 3534 refuted. 0 times theorem prover too weak. 39968 trivial. 0 not checked. [2025-03-09 01:46:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392226583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:08,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 26 [2025-03-09 01:46:08,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895565965] [2025-03-09 01:46:08,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:46:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:08,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:46:08,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:46:08,389 INFO L87 Difference]: Start difference. First operand 194 states and 274 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-09 01:46:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:08,656 INFO L93 Difference]: Finished difference Result 358 states and 541 transitions. [2025-03-09 01:46:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:46:08,660 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 19 states have call successors, (32) Word has length 1159 [2025-03-09 01:46:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:08,662 INFO L225 Difference]: With dead ends: 358 [2025-03-09 01:46:08,662 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 01:46:08,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2355 GetRequests, 2304 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=487, Invalid=1319, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:46:08,664 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 115 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:08,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 198 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 01:46:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2025-03-09 01:46:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 108 states have internal predecessors, (113), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (44), 16 states have call predecessors, (44), 16 states have call successors, (44) [2025-03-09 01:46:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2025-03-09 01:46:08,675 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 1159 [2025-03-09 01:46:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2025-03-09 01:46:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 19 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (32), 13 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-09 01:46:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2025-03-09 01:46:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-03-09 01:46:08,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:08,680 INFO L218 NwaCegarLoop]: trace histogram [83, 82, 67, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 26, 16, 1, 1, 1, 1, 1] [2025-03-09 01:46:08,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:46:08,881 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 01:46:08,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:08,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 412250085, now seen corresponding path program 12 times [2025-03-09 01:46:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778900079] [2025-03-09 01:46:08,882 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:46:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:08,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 811 statements into 64 equivalence classes. [2025-03-09 01:46:08,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) and asserted 775 of 811 statements. [2025-03-09 01:46:08,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2025-03-09 01:46:08,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 4072 proven. 5882 refuted. 0 times theorem prover too weak. 13905 trivial. 0 not checked. [2025-03-09 01:46:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778900079] [2025-03-09 01:46:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778900079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192303313] [2025-03-09 01:46:16,240 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:46:16,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:16,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:16,242 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 01:46:16,242 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 01:46:16,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 811 statements into 64 equivalence classes. [2025-03-09 01:46:16,517 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) and asserted 775 of 811 statements. [2025-03-09 01:46:16,517 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2025-03-09 01:46:16,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:16,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-09 01:46:16,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 3732 proven. 4596 refuted. 0 times theorem prover too weak. 15531 trivial. 0 not checked. [2025-03-09 01:46:16,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 4599 proven. 4261 refuted. 0 times theorem prover too weak. 14999 trivial. 0 not checked. [2025-03-09 01:46:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192303313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:33,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 38] total 52 [2025-03-09 01:46:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151044745] [2025-03-09 01:46:33,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 01:46:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:33,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 01:46:33,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=2149, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:46:33,856 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 14 states have call successors, (36) [2025-03-09 01:46:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:34,075 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2025-03-09 01:46:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:46:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 14 states have call successors, (36) Word has length 811 [2025-03-09 01:46:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:34,077 INFO L225 Difference]: With dead ends: 192 [2025-03-09 01:46:34,077 INFO L226 Difference]: Without dead ends: 191 [2025-03-09 01:46:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1793 GetRequests, 1591 SyntacticMatches, 143 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=784, Invalid=2876, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 01:46:34,078 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:34,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 314 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:46:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-09 01:46:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2025-03-09 01:46:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.0229007633587786) internal successors, (134), 129 states have internal predecessors, (134), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (83), 22 states have call predecessors, (83), 19 states have call successors, (83) [2025-03-09 01:46:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2025-03-09 01:46:34,091 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 811 [2025-03-09 01:46:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2025-03-09 01:46:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.6153846153846154) internal successors, (136), 53 states have internal predecessors, (136), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (36), 36 states have call predecessors, (36), 14 states have call successors, (36) [2025-03-09 01:46:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2025-03-09 01:46:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2061 [2025-03-09 01:46:34,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:34,109 INFO L218 NwaCegarLoop]: trace histogram [212, 207, 172, 107, 107, 107, 107, 104, 104, 104, 104, 104, 103, 103, 103, 102, 65, 40, 1, 1, 1, 1, 1] [2025-03-09 01:46:34,117 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 01:46:34,313 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 01:46:34,313 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 898593379, now seen corresponding path program 13 times [2025-03-09 01:46:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:34,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642689790] [2025-03-09 01:46:34,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:46:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2060 statements into 1 equivalence classes. [2025-03-09 01:46:34,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2060 of 2060 statements. [2025-03-09 01:46:34,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:34,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 156276 backedges. 2359 proven. 16191 refuted. 0 times theorem prover too weak. 137726 trivial. 0 not checked. [2025-03-09 01:46:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642689790] [2025-03-09 01:46:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642689790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145996236] [2025-03-09 01:46:38,062 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:46:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:38,064 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 01:46:38,065 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 01:46:38,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2060 statements into 1 equivalence classes. [2025-03-09 01:46:38,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2060 of 2060 statements. [2025-03-09 01:46:38,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:38,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:38,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:46:38,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 156276 backedges. 78048 proven. 5516 refuted. 0 times theorem prover too weak. 72712 trivial. 0 not checked. [2025-03-09 01:46:38,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 156276 backedges. 2835 proven. 19164 refuted. 0 times theorem prover too weak. 134277 trivial. 0 not checked. [2025-03-09 01:46:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145996236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:41,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:41,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 28] total 33 [2025-03-09 01:46:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413191648] [2025-03-09 01:46:41,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 01:46:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:41,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 01:46:41,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 01:46:41,988 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand has 33 states, 33 states have (on average 5.96969696969697) internal successors, (197), 33 states have internal predecessors, (197), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-09 01:46:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:42,407 INFO L93 Difference]: Finished difference Result 404 states and 673 transitions. [2025-03-09 01:46:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:46:42,408 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.96969696969697) internal successors, (197), 33 states have internal predecessors, (197), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) Word has length 2060 [2025-03-09 01:46:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:42,410 INFO L225 Difference]: With dead ends: 404 [2025-03-09 01:46:42,410 INFO L226 Difference]: Without dead ends: 246 [2025-03-09 01:46:42,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4181 GetRequests, 4101 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1036, Invalid=2996, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:46:42,413 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 525 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:42,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 172 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-09 01:46:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 221. [2025-03-09 01:46:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 178 states have (on average 1.0280898876404494) internal successors, (183), 174 states have internal predecessors, (183), 27 states have call successors, (27), 17 states have call predecessors, (27), 15 states have return successors, (108), 29 states have call predecessors, (108), 26 states have call successors, (108) [2025-03-09 01:46:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 318 transitions. [2025-03-09 01:46:42,426 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 318 transitions. Word has length 2060 [2025-03-09 01:46:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:42,426 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 318 transitions. [2025-03-09 01:46:42,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.96969696969697) internal successors, (197), 33 states have internal predecessors, (197), 28 states have call successors, (35), 5 states have call predecessors, (35), 13 states have return successors, (40), 15 states have call predecessors, (40), 25 states have call successors, (40) [2025-03-09 01:46:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 318 transitions. [2025-03-09 01:46:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2298 [2025-03-09 01:46:42,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:42,447 INFO L218 NwaCegarLoop]: trace histogram [235, 233, 190, 117, 117, 117, 117, 117, 117, 117, 117, 117, 116, 116, 116, 115, 73, 45, 1, 1, 1, 1, 1] [2025-03-09 01:46:42,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:46:42,647 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 01:46:42,648 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:42,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 936893385, now seen corresponding path program 14 times [2025-03-09 01:46:42,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:42,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781153436] [2025-03-09 01:46:42,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:42,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:42,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2297 statements into 2 equivalence classes. [2025-03-09 01:46:42,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2297 of 2297 statements. [2025-03-09 01:46:42,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 194513 backedges. 3656 proven. 21333 refuted. 0 times theorem prover too weak. 169524 trivial. 0 not checked. [2025-03-09 01:46:46,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781153436] [2025-03-09 01:46:46,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781153436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:46,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193976143] [2025-03-09 01:46:46,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:46:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:46,829 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 01:46:46,829 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 01:46:47,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2297 statements into 2 equivalence classes. [2025-03-09 01:46:47,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2297 of 2297 statements. [2025-03-09 01:46:47,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:46:47,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:47,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 4263 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:46:47,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 194513 backedges. 74293 proven. 2667 refuted. 0 times theorem prover too weak. 117553 trivial. 0 not checked. [2025-03-09 01:46:47,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 194513 backedges. 3647 proven. 22267 refuted. 0 times theorem prover too weak. 168599 trivial. 0 not checked. [2025-03-09 01:46:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193976143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:51,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 27] total 32 [2025-03-09 01:46:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786711573] [2025-03-09 01:46:51,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:46:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:51,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:46:51,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:46:51,971 INFO L87 Difference]: Start difference. First operand 221 states and 318 transitions. Second operand has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (41), 14 states have call predecessors, (41), 26 states have call successors, (41) [2025-03-09 01:46:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:46:52,363 INFO L93 Difference]: Finished difference Result 418 states and 639 transitions. [2025-03-09 01:46:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:46:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (41), 14 states have call predecessors, (41), 26 states have call successors, (41) Word has length 2297 [2025-03-09 01:46:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:46:52,365 INFO L225 Difference]: With dead ends: 418 [2025-03-09 01:46:52,365 INFO L226 Difference]: Without dead ends: 203 [2025-03-09 01:46:52,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4638 GetRequests, 4577 SyntacticMatches, 13 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:46:52,368 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 189 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:46:52,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 265 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:46:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-09 01:46:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 167. [2025-03-09 01:46:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.0223880597014925) internal successors, (137), 132 states have internal predecessors, (137), 21 states have call successors, (21), 14 states have call predecessors, (21), 11 states have return successors, (67), 20 states have call predecessors, (67), 20 states have call successors, (67) [2025-03-09 01:46:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2025-03-09 01:46:52,383 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 2297 [2025-03-09 01:46:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:46:52,383 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2025-03-09 01:46:52,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.71875) internal successors, (183), 32 states have internal predecessors, (183), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (41), 14 states have call predecessors, (41), 26 states have call successors, (41) [2025-03-09 01:46:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2025-03-09 01:46:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1984 [2025-03-09 01:46:52,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:46:52,399 INFO L218 NwaCegarLoop]: trace histogram [203, 201, 164, 101, 101, 101, 101, 101, 101, 101, 101, 101, 100, 100, 100, 99, 63, 39, 1, 1, 1, 1, 1] [2025-03-09 01:46:52,411 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 01:46:52,599 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 01:46:52,600 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:46:52,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:46:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 536113693, now seen corresponding path program 15 times [2025-03-09 01:46:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:46:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924641835] [2025-03-09 01:46:52,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:46:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:46:52,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1983 statements into 157 equivalence classes. [2025-03-09 01:46:52,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) and asserted 1395 of 1983 statements. [2025-03-09 01:46:52,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2025-03-09 01:46:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat