./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:43:28,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:43:28,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:43:28,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:43:28,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:43:28,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:43:28,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:43:28,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:43:28,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:43:28,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:43:28,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:43:28,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:43:28,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:43:28,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:43:28,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:43:28,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:43:28,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:43:28,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:43:28,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:43:28,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:43:28,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:43:28,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:43:28,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:43:28,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:43:28,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:43:28,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:43:28,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d1a4b1841ad6fa39491d7c82c38d46725a7eceb7c19c007d9e026b8eedadeb5 [2025-03-17 15:43:28,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:43:28,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:43:28,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:43:28,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:43:28,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:43:28,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-17 15:43:29,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7017b5b05/bc51ad3a1cfe466aa3d9029594d0a637/FLAG1c5b8fc94 [2025-03-17 15:43:29,864 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:43:29,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2025-03-17 15:43:29,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7017b5b05/bc51ad3a1cfe466aa3d9029594d0a637/FLAG1c5b8fc94 [2025-03-17 15:43:29,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7017b5b05/bc51ad3a1cfe466aa3d9029594d0a637 [2025-03-17 15:43:29,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:43:29,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:43:29,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:43:29,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:43:29,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:43:29,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:29" (1/1) ... [2025-03-17 15:43:29,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:29, skipping insertion in model container [2025-03-17 15:43:29,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:43:29" (1/1) ... [2025-03-17 15:43:29,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:43:30,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:43:30,021 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:43:30,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:43:30,041 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:43:30,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30 WrapperNode [2025-03-17 15:43:30,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:43:30,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:43:30,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:43:30,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:43:30,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,063 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-17 15:43:30,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:43:30,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:43:30,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:43:30,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:43:30,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,077 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-17 15:43:30,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:43:30,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:43:30,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:43:30,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:43:30,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (1/1) ... [2025-03-17 15:43:30,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:43:30,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:30,110 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-17 15:43:30,112 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-17 15:43:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-17 15:43:30,128 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-17 15:43:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:43:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:43:30,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:43:30,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:43:30,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:43:30,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:43:30,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4;havoc #t~ret5; [2025-03-17 15:43:30,290 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 15:43:30,291 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:43:30,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:43:30,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:43:30,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:30 BoogieIcfgContainer [2025-03-17 15:43:30,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:43:30,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:43:30,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:43:30,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:43:30,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:43:29" (1/3) ... [2025-03-17 15:43:30,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dada0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:30, skipping insertion in model container [2025-03-17 15:43:30,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:43:30" (2/3) ... [2025-03-17 15:43:30,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dada0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:43:30, skipping insertion in model container [2025-03-17 15:43:30,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:43:30" (3/3) ... [2025-03-17 15:43:30,308 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2025-03-17 15:43:30,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:43:30,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci04.c that has 2 procedures, 29 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 15:43:30,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:43:30,369 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;@2e082d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:43:30,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:43:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 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-17 15:43:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:43:30,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:30,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:43:30,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1001399972, now seen corresponding path program 1 times [2025-03-17 15:43:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96935492] [2025-03-17 15:43:30,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:30,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:43:30,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:43:30,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:30,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:30,492 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-17 15:43:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96935492] [2025-03-17 15:43:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96935492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:43:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:43:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:43:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24833516] [2025-03-17 15:43:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:43:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:43:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:30,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:43:30,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:43:30,510 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:43:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:30,540 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-17 15:43:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:43:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:43:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:30,545 INFO L225 Difference]: With dead ends: 34 [2025-03-17 15:43:30,545 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 15:43:30,547 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-17 15:43:30,548 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:43:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 15:43:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-17 15:43:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-17 15:43:30,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2025-03-17 15:43:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:30,573 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-17 15:43:30,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:43:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-17 15:43:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 15:43:30,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:30,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:43:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:43:30,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:30,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash 978628045, now seen corresponding path program 1 times [2025-03-17 15:43:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689957764] [2025-03-17 15:43:30,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 15:43:30,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 15:43:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:30,646 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-17 15:43:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689957764] [2025-03-17 15:43:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689957764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:43:30,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:43:30,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:43:30,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476600915] [2025-03-17 15:43:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:43:30,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:43:30,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:30,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:43:30,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:43:30,648 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:43:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:30,700 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-17 15:43:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:43:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 15:43:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:30,702 INFO L225 Difference]: With dead ends: 24 [2025-03-17 15:43:30,702 INFO L226 Difference]: Without dead ends: 22 [2025-03-17 15:43:30,703 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-17 15:43:30,704 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:30,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 28 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:43:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-17 15:43:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-17 15:43:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-17 15:43:30,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2025-03-17 15:43:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:30,713 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-17 15:43:30,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:43:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-17 15:43:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:43:30,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:30,714 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:43:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:43:30,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:30,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash -989645326, now seen corresponding path program 1 times [2025-03-17 15:43:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899406964] [2025-03-17 15:43:30,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:43:30,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:43:30,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:30,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:43:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899406964] [2025-03-17 15:43:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899406964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:43:30,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:43:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:43:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771543124] [2025-03-17 15:43:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:43:30,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:43:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:30,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:43:30,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:43:30,856 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:30,903 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-17 15:43:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:43:30,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-17 15:43:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:30,905 INFO L225 Difference]: With dead ends: 34 [2025-03-17 15:43:30,905 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 15:43:30,905 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-17 15:43:30,906 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 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-17 15:43:30,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:43:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 15:43:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-17 15:43:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:43:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-17 15:43:30,913 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 29 [2025-03-17 15:43:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:30,913 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-17 15:43:30,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-17 15:43:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:43:30,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:30,914 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] [2025-03-17 15:43:30,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:43:30,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -61405293, now seen corresponding path program 1 times [2025-03-17 15:43:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848515680] [2025-03-17 15:43:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:43:30,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:43:30,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:30,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:31,048 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-17 15:43:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848515680] [2025-03-17 15:43:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848515680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515973198] [2025-03-17 15:43:31,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:31,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:31,051 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-17 15:43:31,053 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-17 15:43:31,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:43:31,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:43:31,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:31,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:31,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:43:31,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:31,187 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-17 15:43:31,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:31,339 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-17 15:43:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515973198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:31,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-17 15:43:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793824621] [2025-03-17 15:43:31,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 15:43:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:31,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 15:43:31,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:43:31,345 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 15:43:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:31,614 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2025-03-17 15:43:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:43:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2025-03-17 15:43:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:31,616 INFO L225 Difference]: With dead ends: 90 [2025-03-17 15:43:31,616 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 15:43:31,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 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-17 15:43:31,618 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 128 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:31,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 82 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:43:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 15:43:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-03-17 15:43:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.105263157894737) internal successors, (42), 41 states have internal predecessors, (42), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 15:43:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-03-17 15:43:31,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 30 [2025-03-17 15:43:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:31,631 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-03-17 15:43:31,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 15:43:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-03-17 15:43:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:43:31,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:31,634 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-17 15:43:31,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:43:31,834 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-17 15:43:31,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1771203833, now seen corresponding path program 2 times [2025-03-17 15:43:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-17 15:43:31,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:31,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 15:43:31,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:43:31,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:31,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:31,927 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-17 15:43:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-17 15:43:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193747357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79075591] [2025-03-17 15:43:31,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:31,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:31,930 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-17 15:43:31,931 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-17 15:43:31,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-17 15:43:31,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:43:31,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:31,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:43:31,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:32,007 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-17 15:43:32,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:43:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79075591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:43:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:43:32,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-17 15:43:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607636428] [2025-03-17 15:43:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:43:32,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:43:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:32,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:43:32,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:43:32,009 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:32,033 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-17 15:43:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:43:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-17 15:43:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:32,035 INFO L225 Difference]: With dead ends: 59 [2025-03-17 15:43:32,035 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 15:43:32,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:43:32,036 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:32,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:43:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 15:43:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-17 15:43:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.1) internal successors, (44), 42 states have internal predecessors, (44), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (18), 9 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-17 15:43:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-03-17 15:43:32,043 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2025-03-17 15:43:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:32,043 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-03-17 15:43:32,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-03-17 15:43:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:43:32,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:32,044 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-17 15:43:32,049 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-17 15:43:32,244 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-17 15:43:32,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash 927255998, now seen corresponding path program 1 times [2025-03-17 15:43:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-17 15:43:32,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:32,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:43:32,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:43:32,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:32,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:32,315 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-17 15:43:32,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:32,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744069208] [2025-03-17 15:43:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744069208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:32,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863627796] [2025-03-17 15:43:32,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:32,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:32,319 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-17 15:43:32,320 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-17 15:43:32,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:43:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:43:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:32,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:43:32,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:32,407 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-17 15:43:32,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:43:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863627796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:43:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:43:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-17 15:43:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043518658] [2025-03-17 15:43:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:43:32,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:43:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:32,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:43:32,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:43:32,409 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:32,441 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2025-03-17 15:43:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:43:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-17 15:43:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:32,443 INFO L225 Difference]: With dead ends: 81 [2025-03-17 15:43:32,443 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 15:43:32,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:43:32,444 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:32,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:43:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 15:43:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-03-17 15:43:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (27), 11 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-17 15:43:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-17 15:43:32,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 25 [2025-03-17 15:43:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:32,461 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-17 15:43:32,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:43:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-17 15:43:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:43:32,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:32,462 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] [2025-03-17 15:43:32,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:43:32,663 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-17 15:43:32,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:32,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash -72861698, now seen corresponding path program 1 times [2025-03-17 15:43:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520446939] [2025-03-17 15:43:32,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:32,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:43:32,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:43:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:32,807 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-17 15:43:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520446939] [2025-03-17 15:43:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520446939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634742881] [2025-03-17 15:43:32,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:32,809 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-17 15:43:32,810 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-17 15:43:32,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:43:32,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:43:32,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:32,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:32,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:43:32,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:32,914 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-17 15:43:32,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:33,104 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-17 15:43:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634742881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:33,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2025-03-17 15:43:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105328894] [2025-03-17 15:43:33,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 15:43:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:33,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 15:43:33,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:43:33,107 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:43:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:33,255 INFO L93 Difference]: Finished difference Result 140 states and 216 transitions. [2025-03-17 15:43:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:43:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 51 [2025-03-17 15:43:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:33,257 INFO L225 Difference]: With dead ends: 140 [2025-03-17 15:43:33,257 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:43:33,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 93 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-17 15:43:33,258 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:33,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 148 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:43:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 97. [2025-03-17 15:43:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.08) internal successors, (81), 74 states have internal predecessors, (81), 11 states have call successors, (11), 2 states have call predecessors, (11), 9 states have return successors, (66), 20 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-17 15:43:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 158 transitions. [2025-03-17 15:43:33,279 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 158 transitions. Word has length 51 [2025-03-17 15:43:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:33,279 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 158 transitions. [2025-03-17 15:43:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:43:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 158 transitions. [2025-03-17 15:43:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:43:33,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:33,281 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:43:33,288 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-17 15:43:33,481 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-17 15:43:33,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:33,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1555090353, now seen corresponding path program 1 times [2025-03-17 15:43:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858788656] [2025-03-17 15:43:33,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:33,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:43:33,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:43:33,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:33,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 15:43:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858788656] [2025-03-17 15:43:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858788656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087458883] [2025-03-17 15:43:33,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:43:33,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:33,633 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-17 15:43:33,635 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-17 15:43:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:43:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:43:33,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:33,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:33,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:43:33,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 15:43:33,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 15:43:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087458883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:33,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 18 [2025-03-17 15:43:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702341217] [2025-03-17 15:43:33,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:43:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:33,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:43:33,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:43:33,923 INFO L87 Difference]: Start difference. First operand 97 states and 158 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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-17 15:43:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:34,383 INFO L93 Difference]: Finished difference Result 256 states and 503 transitions. [2025-03-17 15:43:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 15:43:34,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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 68 [2025-03-17 15:43:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:34,385 INFO L225 Difference]: With dead ends: 256 [2025-03-17 15:43:34,386 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 15:43:34,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 15:43:34,392 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:34,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 78 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:43:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 15:43:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 102. [2025-03-17 15:43:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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-17 15:43:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 170 transitions. [2025-03-17 15:43:34,408 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 170 transitions. Word has length 68 [2025-03-17 15:43:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:34,409 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 170 transitions. [2025-03-17 15:43:34,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 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-17 15:43:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 170 transitions. [2025-03-17 15:43:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 15:43:34,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:34,411 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] [2025-03-17 15:43:34,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:43:34,612 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-17 15:43:34,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:34,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 465114439, now seen corresponding path program 2 times [2025-03-17 15:43:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-03-17 15:43:34,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:34,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-17 15:43:34,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 15:43:34,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:34,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:34,724 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-17 15:43:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:34,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129396808] [2025-03-17 15:43:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129396808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:34,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986894951] [2025-03-17 15:43:34,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:34,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:34,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:34,727 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-17 15:43:34,728 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-17 15:43:34,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-17 15:43:34,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 15:43:34,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:34,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:43:34,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:34,859 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-17 15:43:34,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:35,169 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-17 15:43:35,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986894951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:35,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:35,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-17 15:43:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686889639] [2025-03-17 15:43:35,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:35,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:43:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:35,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:43:35,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:43:35,172 INFO L87 Difference]: Start difference. First operand 102 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-17 15:43:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:35,255 INFO L93 Difference]: Finished difference Result 161 states and 277 transitions. [2025-03-17 15:43:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:43:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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 128 [2025-03-17 15:43:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:35,257 INFO L225 Difference]: With dead ends: 161 [2025-03-17 15:43:35,257 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 15:43:35,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 244 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-17 15:43:35,258 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:35,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 56 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 15:43:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 15:43:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (26), 10 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-17 15:43:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-17 15:43:35,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 128 [2025-03-17 15:43:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-17 15:43:35,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-17 15:43:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-17 15:43:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 15:43:35,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:35,267 INFO L218 NwaCegarLoop]: trace histogram [20, 17, 16, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 4, 1, 1, 1, 1] [2025-03-17 15:43:35,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:43:35,467 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-17 15:43:35,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:35,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1592610377, now seen corresponding path program 3 times [2025-03-17 15:43:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:35,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-03-17 15:43:35,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:43:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:35,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 17 equivalence classes. [2025-03-17 15:43:35,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 183 statements. [2025-03-17 15:43:35,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 15:43:35,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 331 proven. 18 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-17 15:43:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-03-17 15:43:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154427889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366622602] [2025-03-17 15:43:35,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:43:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:35,573 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-17 15:43:35,575 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-17 15:43:35,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 17 equivalence classes. [2025-03-17 15:43:35,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 183 statements. [2025-03-17 15:43:35,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 15:43:35,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:35,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:43:35,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 328 proven. 21 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-17 15:43:35,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 328 proven. 22 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-17 15:43:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366622602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:35,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2025-03-17 15:43:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161369276] [2025-03-17 15:43:35,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:43:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:35,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:43:35,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:43:35,966 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:43:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:36,052 INFO L93 Difference]: Finished difference Result 123 states and 178 transitions. [2025-03-17 15:43:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:43:36,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 183 [2025-03-17 15:43:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:36,053 INFO L225 Difference]: With dead ends: 123 [2025-03-17 15:43:36,053 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 15:43:36,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 360 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-17 15:43:36,054 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:36,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 15:43:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 15:43:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.08) internal successors, (54), 49 states have internal predecessors, (54), 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-17 15:43:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2025-03-17 15:43:36,061 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 183 [2025-03-17 15:43:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2025-03-17 15:43:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 15:43:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2025-03-17 15:43:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 15:43:36,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:36,063 INFO L218 NwaCegarLoop]: trace histogram [20, 17, 16, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 4, 1, 1, 1, 1] [2025-03-17 15:43:36,068 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-17 15:43:36,263 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-17 15:43:36,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash 457857123, now seen corresponding path program 4 times [2025-03-17 15:43:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-17 15:43:36,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:43:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:36,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 183 statements into 2 equivalence classes. [2025-03-17 15:43:36,281 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 110 of 183 statements. [2025-03-17 15:43:36,281 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:43:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 123 proven. 429 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-17 15:43:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-17 15:43:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149463212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:36,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517520122] [2025-03-17 15:43:36,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:43:36,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:36,452 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-17 15:43:36,453 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-17 15:43:36,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 183 statements into 2 equivalence classes. [2025-03-17 15:43:36,504 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 110 of 183 statements. [2025-03-17 15:43:36,504 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:43:36,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:36,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:43:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 671 proven. 189 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-17 15:43:36,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 144 proven. 501 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-17 15:43:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517520122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:37,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 19 [2025-03-17 15:43:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163692536] [2025-03-17 15:43:37,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:43:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:43:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:43:37,090 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-17 15:43:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:37,291 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2025-03-17 15:43:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:43:37,291 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) Word has length 183 [2025-03-17 15:43:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:37,293 INFO L225 Difference]: With dead ends: 156 [2025-03-17 15:43:37,293 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 15:43:37,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 356 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2025-03-17 15:43:37,295 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:37,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 71 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 15:43:37,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-17 15:43:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 63 states have internal predecessors, (72), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (24), 12 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-17 15:43:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2025-03-17 15:43:37,321 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 183 [2025-03-17 15:43:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2025-03-17 15:43:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 14 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (20), 8 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-17 15:43:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2025-03-17 15:43:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 15:43:37,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:37,325 INFO L218 NwaCegarLoop]: trace histogram [20, 18, 16, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 1, 1, 1, 1] [2025-03-17 15:43:37,331 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-17 15:43:37,529 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-17 15:43:37,529 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:37,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash -503642603, now seen corresponding path program 5 times [2025-03-17 15:43:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896149968] [2025-03-17 15:43:37,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:43:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:37,536 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 15 equivalence classes. [2025-03-17 15:43:37,548 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 147 of 188 statements. [2025-03-17 15:43:37,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 15:43:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 308 proven. 362 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-03-17 15:43:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896149968] [2025-03-17 15:43:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896149968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247230793] [2025-03-17 15:43:37,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:43:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:37,817 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-17 15:43:37,820 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-17 15:43:37,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 15 equivalence classes. [2025-03-17 15:43:37,882 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 147 of 188 statements. [2025-03-17 15:43:37,882 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-17 15:43:37,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:37,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:43:37,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 287 proven. 345 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 15:43:37,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 291 proven. 357 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-03-17 15:43:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247230793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:38,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 21 [2025-03-17 15:43:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734924782] [2025-03-17 15:43:38,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:43:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:38,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:43:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:43:38,512 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-17 15:43:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:38,793 INFO L93 Difference]: Finished difference Result 172 states and 233 transitions. [2025-03-17 15:43:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 15:43:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) Word has length 188 [2025-03-17 15:43:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:38,794 INFO L225 Difference]: With dead ends: 172 [2025-03-17 15:43:38,794 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 15:43:38,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 367 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-17 15:43:38,796 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 97 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 108 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 15:43:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2025-03-17 15:43:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 61 states have internal predecessors, (67), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-17 15:43:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-17 15:43:38,802 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 188 [2025-03-17 15:43:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-17 15:43:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.285714285714286) internal successors, (111), 21 states have internal predecessors, (111), 12 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (22), 13 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-17 15:43:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-17 15:43:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 15:43:38,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:38,803 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 1, 1, 1, 1] [2025-03-17 15:43:38,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 15:43:39,007 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-17 15:43:39,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:39,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1078160514, now seen corresponding path program 6 times [2025-03-17 15:43:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-17 15:43:39,007 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:43:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:39,012 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 129 statements into 9 equivalence classes. [2025-03-17 15:43:39,025 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 15:43:39,025 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-17 15:43:39,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:39,137 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-17 15:43:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889326996] [2025-03-17 15:43:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889326996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392123391] [2025-03-17 15:43:39,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:43:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:39,140 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-17 15:43:39,142 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-17 15:43:39,174 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 129 statements into 9 equivalence classes. [2025-03-17 15:43:39,198 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 15:43:39,198 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-17 15:43:39,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:39,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:43:39,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:39,369 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-17 15:43:39,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:40,161 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-17 15:43:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392123391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:40,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 33 [2025-03-17 15:43:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300347062] [2025-03-17 15:43:40,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 15:43:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:40,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 15:43:40,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 15:43:40,164 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-17 15:43:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:40,645 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2025-03-17 15:43:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 15:43:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) Word has length 129 [2025-03-17 15:43:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:40,647 INFO L225 Difference]: With dead ends: 202 [2025-03-17 15:43:40,647 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 15:43:40,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 229 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=2469, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 15:43:40,649 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:40,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 122 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:43:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 15:43:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2025-03-17 15:43:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.051948051948052) internal successors, (81), 76 states have internal predecessors, (81), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (26), 12 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-17 15:43:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-03-17 15:43:40,657 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 129 [2025-03-17 15:43:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:40,658 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-17 15:43:40,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.4545454545454546) internal successors, (114), 33 states have internal predecessors, (114), 11 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (25), 23 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-17 15:43:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2025-03-17 15:43:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 15:43:40,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:40,662 INFO L218 NwaCegarLoop]: trace histogram [47, 45, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 21, 15, 9, 1, 1, 1, 1] [2025-03-17 15:43:40,668 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-17 15:43:40,863 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-17 15:43:40,863 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash -237754126, now seen corresponding path program 7 times [2025-03-17 15:43:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-03-17 15:43:40,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:43:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:40,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 15:43:40,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 15:43:40,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 558 proven. 2001 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2025-03-17 15:43:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514110255] [2025-03-17 15:43:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514110255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847153449] [2025-03-17 15:43:41,351 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:43:41,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:41,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:41,353 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-17 15:43:41,355 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-17 15:43:41,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 15:43:41,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 15:43:41,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:43:41,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:41,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:43:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 3859 proven. 1245 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2025-03-17 15:43:41,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7309 backedges. 658 proven. 2493 refuted. 0 times theorem prover too weak. 4158 trivial. 0 not checked. [2025-03-17 15:43:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847153449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:42,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 22] total 27 [2025-03-17 15:43:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143980516] [2025-03-17 15:43:42,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 15:43:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:42,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 15:43:42,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-17 15:43:42,788 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-17 15:43:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:43,101 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2025-03-17 15:43:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 15:43:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) Word has length 452 [2025-03-17 15:43:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:43,103 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:43:43,103 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 15:43:43,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 889 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=589, Invalid=1667, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:43:43,104 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 275 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:43,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 131 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 15:43:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2025-03-17 15:43:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.063157894736842) internal successors, (101), 92 states have internal predecessors, (101), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (32), 15 states have call predecessors, (32), 13 states have call successors, (32) [2025-03-17 15:43:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-03-17 15:43:43,131 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 452 [2025-03-17 15:43:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:43,131 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-03-17 15:43:43,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.0) internal successors, (162), 27 states have internal predecessors, (162), 22 states have call successors, (29), 3 states have call predecessors, (29), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-17 15:43:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-03-17 15:43:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-17 15:43:43,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:43,135 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] [2025-03-17 15:43:43,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 15:43:43,339 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-17 15:43:43,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1551605713, now seen corresponding path program 8 times [2025-03-17 15:43:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091057901] [2025-03-17 15:43:43,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:43,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:43,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-03-17 15:43:43,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 15:43:43,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:43,681 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-17 15:43:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091057901] [2025-03-17 15:43:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091057901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018395724] [2025-03-17 15:43:43,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:43:43,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:43,685 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-17 15:43:43,686 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-17 15:43:43,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-03-17 15:43:43,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 306 of 306 statements. [2025-03-17 15:43:43,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:43:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:43,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:43:43,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:43,899 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-17 15:43:43,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:44,938 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-17 15:43:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018395724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:44,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 24 [2025-03-17 15:43:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828557958] [2025-03-17 15:43:44,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:43:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:43:44,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:43:44,940 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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-17 15:43:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:45,200 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-17 15:43:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:43:45,200 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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 306 [2025-03-17 15:43:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:45,201 INFO L225 Difference]: With dead ends: 231 [2025-03-17 15:43:45,201 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 15:43:45,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 599 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=911, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 15:43:45,202 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 69 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:45,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 190 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:43:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 15:43:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2025-03-17 15:43:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.035294117647059) internal successors, (88), 83 states have internal predecessors, (88), 13 states have call successors, (13), 10 states have call predecessors, (13), 7 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-17 15:43:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-03-17 15:43:45,211 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 306 [2025-03-17 15:43:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:45,211 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-03-17 15:43:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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-17 15:43:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-03-17 15:43:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-17 15:43:45,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:45,218 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] [2025-03-17 15:43:45,239 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-17 15:43:45,418 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-17 15:43:45,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1276248419, now seen corresponding path program 9 times [2025-03-17 15:43:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-03-17 15:43:45,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:43:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:45,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 601 statements into 47 equivalence classes. [2025-03-17 15:43:45,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 333 of 601 statements. [2025-03-17 15:43:45,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-17 15:43:45,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:46,910 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-17 15:43:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974581313] [2025-03-17 15:43:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974581313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49179184] [2025-03-17 15:43:46,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:43:46,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:46,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:46,915 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-17 15:43:46,916 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-17 15:43:46,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 601 statements into 47 equivalence classes. [2025-03-17 15:43:47,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) and asserted 333 of 601 statements. [2025-03-17 15:43:47,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2025-03-17 15:43:47,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:47,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-17 15:43:47,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:47,393 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-17 15:43:47,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:51,589 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-17 15:43:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49179184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:51,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 26] total 45 [2025-03-17 15:43:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719238197] [2025-03-17 15:43:51,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:51,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 15:43:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:51,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 15:43:51,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 15:43:51,592 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 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-17 15:43:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:51,825 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2025-03-17 15:43:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 15:43:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 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 601 [2025-03-17 15:43:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:51,829 INFO L225 Difference]: With dead ends: 170 [2025-03-17 15:43:51,829 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 15:43:51,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 1184 SyntacticMatches, 41 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=654, Invalid=2316, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 15:43:51,831 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:51,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 181 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 15:43:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2025-03-17 15:43:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 113 states have (on average 1.0265486725663717) internal successors, (116), 111 states have internal predecessors, (116), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (70), 20 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-17 15:43:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2025-03-17 15:43:51,840 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 601 [2025-03-17 15:43:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:51,841 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2025-03-17 15:43:51,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 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-17 15:43:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2025-03-17 15:43:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2025-03-17 15:43:51,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:51,848 INFO L218 NwaCegarLoop]: trace histogram [115, 111, 93, 58, 58, 58, 58, 56, 56, 56, 56, 56, 55, 55, 55, 54, 35, 22, 1, 1, 1, 1] [2025-03-17 15:43:51,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:43:52,051 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-17 15:43:52,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1257325221, now seen corresponding path program 10 times [2025-03-17 15:43:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646682316] [2025-03-17 15:43:52,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:43:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:52,070 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1111 statements into 2 equivalence classes. [2025-03-17 15:43:52,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 660 of 1111 statements. [2025-03-17 15:43:52,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:43:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 45172 backedges. 1309 proven. 6588 refuted. 0 times theorem prover too weak. 37275 trivial. 0 not checked. [2025-03-17 15:43:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646682316] [2025-03-17 15:43:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646682316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771555660] [2025-03-17 15:43:52,766 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:43:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:52,768 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-17 15:43:52,770 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-17 15:43:52,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1111 statements into 2 equivalence classes. [2025-03-17 15:43:53,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 660 of 1111 statements. [2025-03-17 15:43:53,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:43:53,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:53,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 15:43:53,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 45172 backedges. 23789 proven. 2740 refuted. 0 times theorem prover too weak. 18643 trivial. 0 not checked. [2025-03-17 15:43:53,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 45172 backedges. 1355 proven. 8318 refuted. 0 times theorem prover too weak. 35499 trivial. 0 not checked. [2025-03-17 15:43:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771555660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:54,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 24] total 29 [2025-03-17 15:43:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956516288] [2025-03-17 15:43:54,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 15:43:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:54,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 15:43:54,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:43:54,979 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 24 states have call successors, (31), 5 states have call predecessors, (31), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-17 15:43:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:55,382 INFO L93 Difference]: Finished difference Result 346 states and 571 transitions. [2025-03-17 15:43:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 15:43:55,382 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 24 states have call successors, (31), 5 states have call predecessors, (31), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) Word has length 1111 [2025-03-17 15:43:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:55,384 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:43:55,384 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 15:43:55,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2272 GetRequests, 2205 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=752, Invalid=2004, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 15:43:55,387 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 297 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:55,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 122 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:43:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 15:43:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2025-03-17 15:43:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 155 states have (on average 1.032258064516129) internal successors, (160), 151 states have internal predecessors, (160), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (90), 27 states have call predecessors, (90), 22 states have call successors, (90) [2025-03-17 15:43:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2025-03-17 15:43:55,400 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 1111 [2025-03-17 15:43:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:55,401 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2025-03-17 15:43:55,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.931034482758621) internal successors, (172), 29 states have internal predecessors, (172), 24 states have call successors, (31), 5 states have call predecessors, (31), 11 states have return successors, (34), 13 states have call predecessors, (34), 21 states have call successors, (34) [2025-03-17 15:43:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2025-03-17 15:43:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 948 [2025-03-17 15:43:55,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:55,407 INFO L218 NwaCegarLoop]: trace histogram [97, 96, 78, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 47, 30, 19, 1, 1, 1, 1] [2025-03-17 15:43:55,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 15:43:55,608 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-17 15:43:55,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:55,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash -109249766, now seen corresponding path program 11 times [2025-03-17 15:43:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320246066] [2025-03-17 15:43:55,609 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:43:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:55,624 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 947 statements into 66 equivalence classes. [2025-03-17 15:43:55,686 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 695 of 947 statements. [2025-03-17 15:43:55,686 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-17 15:43:55,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 32715 backedges. 1695 proven. 4591 refuted. 0 times theorem prover too weak. 26429 trivial. 0 not checked. [2025-03-17 15:43:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:43:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320246066] [2025-03-17 15:43:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320246066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:43:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754113468] [2025-03-17 15:43:56,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:43:56,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:43:56,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:43:56,344 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-17 15:43:56,345 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-17 15:43:56,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 947 statements into 66 equivalence classes. [2025-03-17 15:43:56,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) and asserted 695 of 947 statements. [2025-03-17 15:43:56,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2025-03-17 15:43:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:43:56,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:43:56,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:43:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 32715 backedges. 16557 proven. 597 refuted. 0 times theorem prover too weak. 15561 trivial. 0 not checked. [2025-03-17 15:43:56,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:43:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 32715 backedges. 1746 proven. 4887 refuted. 0 times theorem prover too weak. 26082 trivial. 0 not checked. [2025-03-17 15:43:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754113468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:43:58,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:43:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 19] total 26 [2025-03-17 15:43:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439759183] [2025-03-17 15:43:58,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:43:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 15:43:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:43:58,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 15:43:58,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:43:58,551 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) [2025-03-17 15:43:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:43:58,781 INFO L93 Difference]: Finished difference Result 354 states and 521 transitions. [2025-03-17 15:43:58,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:43:58,781 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) Word has length 947 [2025-03-17 15:43:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:43:58,783 INFO L225 Difference]: With dead ends: 354 [2025-03-17 15:43:58,783 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 15:43:58,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1880 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=473, Invalid=1333, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:43:58,785 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:43:58,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 178 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:43:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 15:43:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2025-03-17 15:43:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.0341880341880343) internal successors, (121), 114 states have internal predecessors, (121), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (39), 16 states have call predecessors, (39), 17 states have call successors, (39) [2025-03-17 15:43:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2025-03-17 15:43:58,792 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 947 [2025-03-17 15:43:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:43:58,793 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2025-03-17 15:43:58,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (31), 15 states have call predecessors, (31), 17 states have call successors, (31) [2025-03-17 15:43:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2025-03-17 15:43:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-17 15:43:58,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:43:58,796 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] [2025-03-17 15:43:58,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 15:43:58,996 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-17 15:43:58,997 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:43:58,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:43:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash -34672889, now seen corresponding path program 12 times [2025-03-17 15:43:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:43:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862453036] [2025-03-17 15:43:58,997 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:43:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:43:59,013 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 810 statements into 64 equivalence classes. [2025-03-17 15:43:59,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) and asserted 774 of 810 statements. [2025-03-17 15:43:59,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2025-03-17 15:43:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23859 backedges. 4168 proven. 5850 refuted. 0 times theorem prover too weak. 13841 trivial. 0 not checked. [2025-03-17 15:44:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:06,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862453036] [2025-03-17 15:44:06,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862453036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:06,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956162418] [2025-03-17 15:44:06,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:44:06,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:06,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:06,344 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-17 15:44:06,350 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-17 15:44:06,488 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 810 statements into 64 equivalence classes. [2025-03-17 15:44:06,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) and asserted 774 of 810 statements. [2025-03-17 15:44:06,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2025-03-17 15:44:06,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:06,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 165 conjuncts are in the unsatisfiable core [2025-03-17 15:44:06,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:07,152 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-17 15:44:07,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:24,498 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-17 15:44:24,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956162418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:24,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:24,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 38] total 53 [2025-03-17 15:44:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590151032] [2025-03-17 15:44:24,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:24,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-17 15:44:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:24,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-17 15:44:24,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2219, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 15:44:24,501 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) [2025-03-17 15:44:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:24,728 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2025-03-17 15:44:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 15:44:24,728 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) Word has length 810 [2025-03-17 15:44:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:24,730 INFO L225 Difference]: With dead ends: 200 [2025-03-17 15:44:24,730 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 15:44:24,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1791 GetRequests, 1588 SyntacticMatches, 143 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=827, Invalid=2955, Unknown=0, NotChecked=0, Total=3782 [2025-03-17 15:44:24,732 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:24,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 174 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:44:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 15:44:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 172. [2025-03-17 15:44:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 135 states have internal predecessors, (142), 21 states have call successors, (21), 14 states have call predecessors, (21), 12 states have return successors, (75), 22 states have call predecessors, (75), 20 states have call successors, (75) [2025-03-17 15:44:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 238 transitions. [2025-03-17 15:44:24,744 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 238 transitions. Word has length 810 [2025-03-17 15:44:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 238 transitions. [2025-03-17 15:44:24,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.6037735849056602) internal successors, (138), 54 states have internal predecessors, (138), 14 states have call successors, (15), 1 states have call predecessors, (15), 15 states have return successors, (37), 37 states have call predecessors, (37), 14 states have call successors, (37) [2025-03-17 15:44:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 238 transitions. [2025-03-17 15:44:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1380 [2025-03-17 15:44:24,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:24,753 INFO L218 NwaCegarLoop]: trace histogram [141, 140, 114, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 69, 44, 27, 1, 1, 1, 1] [2025-03-17 15:44:24,761 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-17 15:44:24,953 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-17 15:44:24,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1557069682, now seen corresponding path program 13 times [2025-03-17 15:44:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:24,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655198229] [2025-03-17 15:44:24,954 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:44:24,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:24,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1379 statements into 1 equivalence classes. [2025-03-17 15:44:25,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1379 of 1379 statements. [2025-03-17 15:44:25,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:25,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 69791 backedges. 2778 proven. 10659 refuted. 0 times theorem prover too weak. 56354 trivial. 0 not checked. [2025-03-17 15:44:26,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655198229] [2025-03-17 15:44:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655198229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927570455] [2025-03-17 15:44:26,907 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:44:26,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:26,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:26,908 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-17 15:44:26,909 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-17 15:44:27,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1379 statements into 1 equivalence classes. [2025-03-17 15:44:27,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1379 of 1379 statements. [2025-03-17 15:44:27,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:44:27,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:27,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 2569 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 15:44:27,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 69791 backedges. 3295 proven. 12189 refuted. 0 times theorem prover too weak. 54307 trivial. 0 not checked. [2025-03-17 15:44:27,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 69791 backedges. 3295 proven. 12357 refuted. 0 times theorem prover too weak. 54139 trivial. 0 not checked. [2025-03-17 15:44:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927570455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:30,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 31] total 36 [2025-03-17 15:44:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949019304] [2025-03-17 15:44:30,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 15:44:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:30,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 15:44:30,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 15:44:30,781 INFO L87 Difference]: Start difference. First operand 172 states and 238 transitions. Second operand has 36 states, 36 states have (on average 5.694444444444445) internal successors, (205), 36 states have internal predecessors, (205), 30 states have call successors, (35), 1 states have call predecessors, (35), 15 states have return successors, (46), 18 states have call predecessors, (46), 30 states have call successors, (46) [2025-03-17 15:44:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:31,231 INFO L93 Difference]: Finished difference Result 418 states and 687 transitions. [2025-03-17 15:44:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-17 15:44:31,234 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.694444444444445) internal successors, (205), 36 states have internal predecessors, (205), 30 states have call successors, (35), 1 states have call predecessors, (35), 15 states have return successors, (46), 18 states have call predecessors, (46), 30 states have call successors, (46) Word has length 1379 [2025-03-17 15:44:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:31,237 INFO L225 Difference]: With dead ends: 418 [2025-03-17 15:44:31,237 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 15:44:31,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2819 GetRequests, 2739 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1076, Invalid=3346, Unknown=0, NotChecked=0, Total=4422 [2025-03-17 15:44:31,240 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 350 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:31,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 235 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:44:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 15:44:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2025-03-17 15:44:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 173 states have internal predecessors, (182), 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-17 15:44:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 317 transitions. [2025-03-17 15:44:31,259 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 317 transitions. Word has length 1379 [2025-03-17 15:44:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:31,259 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 317 transitions. [2025-03-17 15:44:31,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.694444444444445) internal successors, (205), 36 states have internal predecessors, (205), 30 states have call successors, (35), 1 states have call predecessors, (35), 15 states have return successors, (46), 18 states have call predecessors, (46), 30 states have call successors, (46) [2025-03-17 15:44:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 317 transitions. [2025-03-17 15:44:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2460 [2025-03-17 15:44:31,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:31,284 INFO L218 NwaCegarLoop]: trace histogram [252, 249, 204, 126, 126, 126, 126, 125, 125, 125, 125, 125, 124, 124, 124, 123, 78, 48, 1, 1, 1, 1] [2025-03-17 15:44:31,294 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-17 15:44:31,484 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-17 15:44:31,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1141601227, now seen corresponding path program 14 times [2025-03-17 15:44:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226560086] [2025-03-17 15:44:31,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:44:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:31,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2459 statements into 2 equivalence classes. [2025-03-17 15:44:31,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2459 of 2459 statements. [2025-03-17 15:44:31,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:44:31,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 223213 backedges. 5358 proven. 22010 refuted. 0 times theorem prover too weak. 195845 trivial. 0 not checked. [2025-03-17 15:44:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226560086] [2025-03-17 15:44:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226560086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107071054] [2025-03-17 15:44:37,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:44:37,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:37,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:37,189 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-17 15:44:37,190 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-17 15:44:37,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2459 statements into 2 equivalence classes. [2025-03-17 15:44:37,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2459 of 2459 statements. [2025-03-17 15:44:37,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:44:37,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:37,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 4563 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 15:44:37,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 223213 backedges. 105094 proven. 14267 refuted. 0 times theorem prover too weak. 103852 trivial. 0 not checked. [2025-03-17 15:44:38,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 223213 backedges. 6275 proven. 25235 refuted. 0 times theorem prover too weak. 191703 trivial. 0 not checked. [2025-03-17 15:44:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107071054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:42,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 33] total 38 [2025-03-17 15:44:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141877690] [2025-03-17 15:44:42,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:42,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 15:44:42,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 15:44:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 15:44:42,604 INFO L87 Difference]: Start difference. First operand 220 states and 317 transitions. Second operand has 38 states, 38 states have (on average 5.973684210526316) internal successors, (227), 38 states have internal predecessors, (227), 33 states have call successors, (40), 4 states have call predecessors, (40), 16 states have return successors, (49), 18 states have call predecessors, (49), 31 states have call successors, (49) [2025-03-17 15:44:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:43,274 INFO L93 Difference]: Finished difference Result 509 states and 812 transitions. [2025-03-17 15:44:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 15:44:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 5.973684210526316) internal successors, (227), 38 states have internal predecessors, (227), 33 states have call successors, (40), 4 states have call predecessors, (40), 16 states have return successors, (49), 18 states have call predecessors, (49), 31 states have call successors, (49) Word has length 2459 [2025-03-17 15:44:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:43,278 INFO L225 Difference]: With dead ends: 509 [2025-03-17 15:44:43,278 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 15:44:43,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4997 GetRequests, 4898 SyntacticMatches, 19 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1599, Invalid=5043, Unknown=0, NotChecked=0, Total=6642 [2025-03-17 15:44:43,282 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 771 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:43,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 195 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:44:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 15:44:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2025-03-17 15:44:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.0333333333333334) internal successors, (217), 204 states have internal predecessors, (217), 32 states have call successors, (32), 22 states have call predecessors, (32), 16 states have return successors, (114), 32 states have call predecessors, (114), 31 states have call successors, (114) [2025-03-17 15:44:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2025-03-17 15:44:43,298 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 2459 [2025-03-17 15:44:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2025-03-17 15:44:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.973684210526316) internal successors, (227), 38 states have internal predecessors, (227), 33 states have call successors, (40), 4 states have call predecessors, (40), 16 states have return successors, (49), 18 states have call predecessors, (49), 31 states have call successors, (49) [2025-03-17 15:44:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2025-03-17 15:44:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2025-03-17 15:44:43,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:43,305 INFO L218 NwaCegarLoop]: trace histogram [116, 114, 94, 58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 56, 36, 22, 1, 1, 1, 1] [2025-03-17 15:44:43,318 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-17 15:44:43,505 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-17 15:44:43,506 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -840858933, now seen corresponding path program 15 times [2025-03-17 15:44:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594813099] [2025-03-17 15:44:43,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:44:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:43,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1130 statements into 84 equivalence classes. [2025-03-17 15:44:43,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 448 of 1130 statements. [2025-03-17 15:44:43,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-17 15:44:43,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 46724 backedges. 5771 proven. 1116 refuted. 0 times theorem prover too weak. 39837 trivial. 0 not checked. [2025-03-17 15:44:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594813099] [2025-03-17 15:44:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594813099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394013594] [2025-03-17 15:44:43,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:44:43,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:43,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:43,851 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:44:43,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 15:44:44,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1130 statements into 84 equivalence classes. [2025-03-17 15:44:44,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) and asserted 448 of 1130 statements. [2025-03-17 15:44:44,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2025-03-17 15:44:44,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:44,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:44:44,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 46724 backedges. 5765 proven. 1110 refuted. 0 times theorem prover too weak. 39849 trivial. 0 not checked. [2025-03-17 15:44:44,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 46724 backedges. 5765 proven. 1173 refuted. 0 times theorem prover too weak. 39786 trivial. 0 not checked. [2025-03-17 15:44:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394013594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:46,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 19] total 26 [2025-03-17 15:44:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603502418] [2025-03-17 15:44:46,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:46,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 15:44:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:46,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 15:44:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:44:46,118 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 12 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-17 15:44:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:44:46,393 INFO L93 Difference]: Finished difference Result 504 states and 713 transitions. [2025-03-17 15:44:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 15:44:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 12 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) Word has length 1130 [2025-03-17 15:44:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:44:46,395 INFO L225 Difference]: With dead ends: 504 [2025-03-17 15:44:46,395 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 15:44:46,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2293 GetRequests, 2247 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:44:46,399 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:44:46,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 195 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:44:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 15:44:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 199. [2025-03-17 15:44:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 158 states have internal predecessors, (167), 26 states have call successors, (26), 22 states have call predecessors, (26), 10 states have return successors, (47), 18 states have call predecessors, (47), 25 states have call successors, (47) [2025-03-17 15:44:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 240 transitions. [2025-03-17 15:44:46,409 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 240 transitions. Word has length 1130 [2025-03-17 15:44:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:44:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 240 transitions. [2025-03-17 15:44:46,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 12 states have call successors, (21), 1 states have call predecessors, (21), 11 states have return successors, (27), 18 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-17 15:44:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 240 transitions. [2025-03-17 15:44:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2570 [2025-03-17 15:44:46,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:44:46,433 INFO L218 NwaCegarLoop]: trace histogram [264, 259, 214, 133, 133, 133, 133, 130, 130, 130, 130, 130, 129, 129, 129, 128, 81, 50, 1, 1, 1, 1] [2025-03-17 15:44:46,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 15:44:46,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:46,634 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:44:46,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:44:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash 23342089, now seen corresponding path program 16 times [2025-03-17 15:44:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:44:46,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780719669] [2025-03-17 15:44:46,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:44:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:44:46,670 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2569 statements into 2 equivalence classes. [2025-03-17 15:44:46,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1524 of 2569 statements. [2025-03-17 15:44:46,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:44:46,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 243687 backedges. 7800 proven. 20844 refuted. 0 times theorem prover too weak. 215043 trivial. 0 not checked. [2025-03-17 15:44:49,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:44:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780719669] [2025-03-17 15:44:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780719669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:44:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586777045] [2025-03-17 15:44:49,594 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:44:49,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:44:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:44:49,596 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:44:49,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 15:44:50,014 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2569 statements into 2 equivalence classes. [2025-03-17 15:44:50,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1524 of 2569 statements. [2025-03-17 15:44:50,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 15:44:50,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:44:50,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 15:44:50,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:44:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 243687 backedges. 15731 proven. 22124 refuted. 0 times theorem prover too weak. 205832 trivial. 0 not checked. [2025-03-17 15:44:50,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:44:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 243687 backedges. 15731 proven. 22361 refuted. 0 times theorem prover too weak. 205595 trivial. 0 not checked. [2025-03-17 15:44:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586777045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:44:55,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:44:55,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 42] total 50 [2025-03-17 15:44:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172761235] [2025-03-17 15:44:55,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:44:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-17 15:44:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:44:55,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-17 15:44:55,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2116, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 15:44:55,980 INFO L87 Difference]: Start difference. First operand 199 states and 240 transitions. Second operand has 50 states, 50 states have (on average 5.44) internal successors, (272), 48 states have internal predecessors, (272), 41 states have call successors, (49), 8 states have call predecessors, (49), 18 states have return successors, (56), 23 states have call predecessors, (56), 35 states have call successors, (56)